Shortest Distance Problems in Graphs Using History-Dependent Transition Costs with Application to Kinodynamic Path Planning

被引：10

作者：

Cowlagi, Raghvendra V. ^{[1
]}

Tsiotras, Panagiotis ^{[2
]}

机构：

[1] Georgia Inst Technol, Sch Aerosp Engn, Atlanta, GA 30332 USA

[2] Georgia Inst Technol, Fac Aerosp Engn, Atlanta, GA 30332 USA

来源：

2009 AMERICAN CONTROL CONFERENCE, VOLS 1-9 | 2009年

关键词：

MULTIRESOLUTION; QUADTREE;

D O I：

10.1109/ACC.2009.5160149

中图分类号：

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

学科分类号：

0812 ;

摘要：

A new algorithm is presented to compute the shortest path on a graph when the node transition costs depend on the prior history or the path to the current node. The algorithm is applied to solve path planning problems with curvature constraints.

引用

页码：414 / +

页数：2

共 22 条

[1] ROBOT MOTION PLANNING - A DISTRIBUTED REPRESENTATION APPROACH [J].

BARRAQUAND, J ;

LATOMBE, JC .

INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 1991, 10 (06) :628-649

[2]

Behnke S, 2004, LECT NOTES COMPUT SC, V3020, P332

[3]

Bereg S., 2005, Proceedings of the 21st Annual Symposium on Computational Geometry, (Pisa, Italy), P278

[4]

Bertsekas Dimitri P, 2000, Dynamic programming and optimal control, V1

[5]

Cormen T.H., 2001, Introduction To Algorithms, Vsecond

[6] Multiresolution path planning with wavelets: A local replanning approach [J].

Cowlagi, Raghvendra V. ;

Tsiotras, Panagiotis .

2008 AMERICAN CONTROL CONFERENCE, VOLS 1-12, 2008, :1220-+

[7]

COWLAGI RV, 2007, P 46 IEEE C DEC CONT, P1392

[8] KINODYNAMIC MOTION PLANNING [J].

DONALD, B ;

XAVIER, P ;

CANNY, J ;

REIF, J .

JOURNAL OF THE ACM, 1993, 40 (05) :1048-1066

[9] Real-time motion planning for agile autonomous vehicles [J].

Frazzoli, E ;

Dahleh, MA ;

Feron, E .

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS, 2002, 25 (01) :116-129

[10] Randomized kinodynamic motion planning with moving obstacles [J].

Hsu, D ;

Kindel, R ;

Latombe, JC ;

Rock, S .

INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 2002, 21 (03) :233-255

← 1 2 3 →