A Path Planning Algorithm Based on Dynamic Networks and Restricted Searching Area

Author

Fu, Mengyin ; Xue, Bin

Author_Institution

Beijing Inst. of Technol., Beijing

fYear

2007

fDate

18-21 Aug. 2007

Firstpage

1193

Lastpage

1197

Abstract

This paper simplifies the discrete-time dynamic networks model according to the realistic character of the urban traffic system, proposes one kind of A* algorithm based on restricted searching area (RA*) to compute the fastest path, analyzes the performance of RA* and validates its efficiency with contrast to other routing planning algorithms.

Keywords

path planning; road traffic; search problems; transportation; dynamic networks; path planning algorithm; restricted searching area; urban traffic system; Automation; Computer networks; Cost function; Heuristic algorithms; Logistics; Path planning; Roads; Telecommunication traffic; Vehicle dynamics; Vehicles; A* algorithm; Discrete-time dynamic networks; Fastest path; Restricted searching area;

fLanguage

English

Publisher

ieee

Conference_Titel

Automation and Logistics, 2007 IEEE International Conference on

Conference_Location

Jinan

Print_ISBN

978-1-4244-1531-1

Type

conf

DOI

10.1109/ICAL.2007.4338750

Filename

4338750

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3472062