Pseudo priority queues for real-time performance on dynamic programming processes applied to path planning

Proceedings of the 2010 Australasian Conference on Robotics and Automation, ACRA 2010

Volumn , Issue , 2010, Pages

  Robledo, Alicia ^a   Guivant, Jose ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COSTS; DIJKSTRA ALGORITHMS; DIJKSTRA'S ALGORITHMS; LOWER BOUNDS; LOWER COST; ON DYNAMICS; OPTIMAL SOLUTIONS; PRIORITY QUEUES; PROGRAMMING PROCESS; REAL TIME PERFORMANCE; REAL-TIME APPLICATION; REAL-TIME OPERATION; ROBOTIC PLATFORMS;

ALGORITHMS; DYNAMIC PROGRAMMING; MOTION PLANNING; OPTIMAL SYSTEMS; OPTIMIZATION; QUEUEING THEORY; ROBOTICS; ROBOTS;

ROBOT PROGRAMMING;

EID: 84855615130     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. Bellman, R. Dynamic programming. Princeton University Press, Princeton, NJ. 1957
2. E.W. Dijkstra. A note on two problems in connexion with graphs. In Numerische Mathematik, 1 (1), pp. 269-271
3. Nieto, J., Guivant, J., Nebot, E. DenseSLAM: Simultaneous localization and dense mapping. In International Journal of Robotics Research, 25 (8), pp. 711-744. (2006) (Pubitemid 44060267)
4. Nieto, J.I., Guivant, J.E., Nebot, E.M. The hybrid metric maps (HYMMs): A novel map representation for DenseSLAM In Proceedings - IEEE International Conference on Robotics and Automation, 2004 (1), pp. 391-396. (2004)
5. Sethian, J.A., Vladimirsky, A. Ordered upwind methods for static Hamilton-Jacobi equations: Theory and algorithms. In SIAM Journal on Numerical Analysis, 41 (1), pp. 325-363. (2003)
6. J.A. Sethian A fast marching level set method for monotonically advancing fronts. In Proceedings of the National Academy of Sciences of the United States of America, 93 (4), pp. 1591-1595. (1996) (Pubitemid 26075170)
7. L. Yatziv, A. Bartesaghi, G. Sapiro. O(N) implementation of the fast marching algorithm In Journal of Computational Physics, 212 (2), pp. 393-399. (2006). (Pubitemid 41799930)
8. LaValle, S.M., Kuffner, J.J. Rapidly-exploring random trees: Progress and prospects In Algorithmic and Computational Robotics: New Directions, p. 293-308. (2001)
9. Kuffner, J.J., La Valle, S.M. RRT Connect: An efficient appoach to single query path planning In Proc. 2000 IEEE Int'l Conf. on Robotics and Automation(ICRA 2000), San Francisco, CA April 2000
10. Kavraki, L.E., Švestka, P., Latombe, J.-C., Overmars, M.H. Probabilistic roadmaps for path planning in high-dimensional configuration spaces In IEEE Transactions on Robotics and Automation, 12 (4), pp. 566-580. (1996) (Pubitemid 126774162)
11. Whitty, M.A and Guivant J. Efficient path planning in deformable maps. In IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2009; St. Louis, MO; October 2009. pp 5401