✦ LIBER ✦

Robot path planning using dynamic programming with accelerating nodes

✍ Scribed by Rahul Kala, Anupam Shukla, Ritu Tiwari

Book ID: 115064100
Publisher: SP Versita
Year: 2012
Tongue: English
Weight: 922 KB
Volume: 3
Category: Article
ISSN: 2080-9778
DOI: 10.2478/s13230-012-0013-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamic path planning of mobile robots w

Dynamic path planning of mobile robots with improved genetic algorithm

✍ Tuncer, Adem; Yildirim, Mehmet 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 785 KB

Near Optimal Measuring Sequence Planning

Near Optimal Measuring Sequence Planning and Collision-Free Path Planning with a Dynamic Programming Method

✍ Z.-C. Lin; J.-J. Chow 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 319 KB

Real-Time Robot Path Planning via a Dist

Real-Time Robot Path Planning via a Distance-Propagating Dynamic System with Obstacle Clearance

✍ Willms, A.R.; Yang, S.X. 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 953 KB

Efficient environment representation for

Efficient environment representation for mobile robot path planning using CVT-PRM with Halton sampling

✍ Park, B.; Chung, W.K. 📂 Article 📅 2012 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 251 KB

[IEEE The 23rd IEEE Conference on Decisi

[IEEE The 23rd IEEE Conference on Decision and Control - (1984.12.12-1984.12.14)] The 23rd IEEE Conference on Decision and Control - Robot path planning using dynamic programming

✍ Shin, Kang; McKay, Neil 📂 Article 📅 1984 🏛 IEEE ⚖ 675 KB

A dynamic programming algorithm for the

A dynamic programming algorithm for the shortest path problem with time windows and linear node costs

✍ Ioachim, Irina; G�linas, Sylvie; Soumis, Fran�ois; Desrosiers, Jacques 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 3 views

This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time windows and additional linear costs on the node service start times. To optimally solve this problem, we propose a new dynamic programming algorithm w