3D time-space path planning algorithm in dynamic environment utilizing arrival time field and heuristically randomized tree

Proceedings - IEEE International Conference on Robotics and Automation

Volumn , Issue , 2012, Pages 187-192

  Ardiyanto, Igi ^a   Miura, Jun ^a  

^a TOYOHASHI UNIVERSITY OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; ROBOT PROGRAMMING; TREES (MATHEMATICS);

ARRIVAL TIME; CLUTTERED ENVIRONMENTS; DYNAMIC ENVIRONMENTS; DYNAMIC OBSTACLES; MOVING OBSTACLES; PATH PLANNING PROBLEMS; PATH-PLANNING ALGORITHM; RANDOMIZED TREES;

MOTION PLANNING;

EID: 84864463452     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICRA.2012.6224664     Document Type: Conference Paper

References (17)

1. M. S. Hassouna, A. E. Abdel-Hakim and A. A. Farag. "PDE-based robust robotic navigation". Image and Vision Computing, vol. 27, pp. 10-18, 2009.
2. S. M. LaValle and J. Kuffner. "Rapidly-exploring random trees: Progress and prospects". In Proc. of Fourth Intl. Workshop on Algorithmic Foundations onRobotics (WAFR'00), 2000.
3. C. Urmson and R. Simmons, "Approaches for heuristically biasing RRT growth". In Proc. of the IEEE Int. Conf. on Intelligent Robots and Systems (IROS), 2003.
4. S. M. LaValleand J. Kuffner. "Randomized kinodynamic planning". In Proc.IEEE Int. Conf. Robotics and Automation (ICRA), pages 473-479, 1999.
5. S. Karaman and E. Frazzoli. "Incremental sampling-based optimal motion planning". In Robotics: Science and Systems (RSS), 2010.
6. L. Jaillet, J. Cortes, and T. Simeon. "Sampling-Based Path Planning on Configuration-Space Costmaps". IEEE Transactions on Robotics,vol. 26, no. 4, pp. 635-646, Aug. 2010.
7. M. Zucker, J. Kuffner, and J. A. Bagnell. "Adaptive workspace biasing for sampling-based planners". In Proc. IEEE Int. Conf. on Robotics and Automation (ICRA), pp. 3757-3762 (2008).
8. E. Plaku, L. E. Kavraki, and M. Y. Vardi. "A Motion Planner for a Hybrid Robotic System with Kinodynamic Constraints". In Proc. of the 2007 IEEE Int. Conf. on Robotics and Automation, pp. 692-697.
9. A. Shigemura, Y. Ishikawa, J. Miura , and J. Satake. "People Movement Simulation in Public Space and Its Application to Robot Motion Planner Development". Proc. 2010 Int. Conf. on Advanced Mechatronics, pp. 504-509, Osaka, Japan, Oct. 2010.
10. N. Ando, T. Suehiro, K. Kitagaki, T. Kotoku, and W.K. Yoon. "RT-middleware: Distributed component middleware for RT (robot technology)". In: Proceedings of 2005 IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, pp. 3555-3560, 2005.
11. J. Sethian. "A fast marching level set method for monotonically advancing fronts". In Proc. Natl. Acad. Sci. volume 93, pages 1591-1595, 1996.
12. H. Zhao. "A fast sweeping method for eikonal equations". Mathematics of Computation, 74:603-627, 2004
13. I. Ardiyanto and J. Miura. "Heuristically Arrival Time Field-Biased (HeAT) Random Tree: An Online Path Planning Algorithm for Mobile Robot Considering Kinodynamic Constraints". In Proc. 2011 IEEE Int. Conf. on Robotics and Biomimetics, pp. 360-365, Phuket, Thailand, Dec. 2011.
14. J. Won-Ki and W. Ross. "A Fast Iterative Method for Eikonal Equations". SIAM J. Sci. Comput. 30, pp. 2512-2534.
15. V. Vonasek, J. Faigl, T. Krajnik, and L. Preucil. "A Sampling Scheme for Rapidly Exploring Random Trees using a Guiding Path". In Proc. 5th European Conf. on Mobile Robots, pp. 201-206, 2011.
16. M. Zucker, J. Kuffner, and M. Branicky. "Multipartite RRTs for Rapid Replanning in Dynamic Environments". In Proc. IEEE ICRA 2007, pp. 1603-1609.
17. K. Fujimura. "Time-Minimum Routes in Time-Dependent Networks". IEEE Trans. on Robotics and Automation, Vol. 11, No. 3, pp. 343351, 1995.