A path planning algorithm based on dynamic networks and restricted searching area

被引：9

作者：

Fu, Mengyin ^{[1
]}

Xue, Bin ^{[1
]}

机构：

[1] Beijing Inst Technol, Dept Automat Control, Beijing 100081, Peoples R China

来源：

2007 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION AND LOGISTICS, VOLS 1-6 | 2007年

关键词：

discrete-time dynamic networks; A* algorithm; fastest path; restricted searching area;

D O I：

10.1109/ICAL.2007.4338750

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：1193 / 1197

页数：5

共 8 条

[1]

Fu Mengyin, 2004, T BEIJING I TECHNOLO, V24, P881

[2] A FORMAL BASIS FOR HEURISTIC DETERMINATION OF MINIMUM COST PATHS [J].

HART, PE ;

NILSSON, NJ ;

RAPHAEL, B .

IEEE TRANSACTIONS ON SYSTEMS SCIENCE AND CYBERNETICS, 1968, SSC4 (02) :100-+

[3] Rhodes to Intelligent Transportation Systems [J].

Mirchandani, P ;

Wang, FY .

IEEE INTELLIGENT SYSTEMS, 2005, 20 (01) :10-15

[4]

Ren Jiang-tao, 2001, Information and Control, V30, P550

[5]

SONG Y, 2004, TRAFFIC COMPUTER, V22, P28

[6]

WANG WL, 2005, ARTIFICIAL INTELLIGE

[7] Travel time prediction using the GPS test vehicle and Kalman filtering techniques [J].

Yang, JS .

ACC: Proceedings of the 2005 American Control Conference, Vols 1-7, 2005, :2128-2133

[8]

ZHANG QS, 2002, INTELLIGENT VEHICLE

← 1 →