Welcome to the InfoSci Platform
Reference Hub6
A Note on the Connection Between the Primal-Dual and the A* Algorithm

A Note on the Connection Between the Primal-Dual and the A* Algorithm

Xugang Ye, Shih-Ping Han, Anhua Lin
Copyright: © 2010 |Volume: 1 |Issue: 1 |Pages: 13
ISSN: 1947-9328|EISSN: 1947-9336|EISBN13: 9781616929985|DOI: 10.4018/joris.2010101305
Cite Article Cite Article

MLA

Ye, Xugang, et al. "A Note on the Connection Between the Primal-Dual and the A* Algorithm." IJORIS vol.1, no.1 2010: pp.73-85. http://doi.org/10.4018/joris.2010101305

APA

Ye, X., Han, S., & Lin, A. (2010). A Note on the Connection Between the Primal-Dual and the A* Algorithm. International Journal of Operations Research and Information Systems (IJORIS), 1(1), 73-85. http://doi.org/10.4018/joris.2010101305

Chicago

Ye, Xugang, Shih-Ping Han, and Anhua Lin. "A Note on the Connection Between the Primal-Dual and the A* Algorithm," International Journal of Operations Research and Information Systems (IJORIS) 1, no.1: 73-85. http://doi.org/10.4018/joris.2010101305

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The primal-dual algorithm for linear programming is very effective for solving network flow problems. For the method to work, an initial feasible solution to the dual is required. In this article, we show that, for the shortest path problem in a positively weighted graph equipped with a consistent heuristic function, the primal-dual algorithm will become the well-known A* algorithm if a special initial feasible solution to the dual is chosen. We also show how the improvements of the dual objective are related to the A* iterations.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.