Abstract
In this paper a contribution to the practice of path planning using a new hierarchical extension of the D* algorithm is introduced. A hierarchical graph is stratified into several abstraction levels and used to model environments for path planning. The hierarchical D* algorithm uses a down-top strategy and a set of pre-calculated trajectories in order to improve performance. This allows optimality and specially lower computational time. It is experimentally proved how hierarchical search algorithms and on-line path planning algorithms based on topological abstractions can be combined successfully.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Ahuactzin, J. M., Talbi, E.-G., Bessiere, P., and Mazer, E.: Using genetic algorithms for robot motion planning, in: Proc. of the 10th European Conf. on Artificial Intelligence, 1992, pp. 671–675.
Ashiru, I., Czarnecki, C., and Routen, T.: Characteristics of a genetic based approach to path planning for mobile robots, J. Network Computer Appl. 19 (1996), 149–169.
Cagigas, D. and Abascal, J.: Hierarchical path search with partial materialization of costs for a smart wheelchair, J. Intelligent Robotic Systems 39 (2004), 409–431.
Civit-Balcells, A. and Abascal, J.: TetraNauta: A wheelchair controller for users with severe mobility restrictions, in: 3rd TIDE Congress, Helsinki, Finland, 23–25 June 1998.
Conte, G. and Zulli, R.: Hierarchical path planning in a multi-robot environment with a simple navigation function, IEEE Trans. Systems Man Cybernet. 25(4) (1995), 651–654.
Fernandez, J. A. and Gonzalez, J.: A general world representation for mobile robot operations, in: Seventh Conf. of the Spanish Association for the Artificial Intelligence, Malaga, Spain, 1997.
Fernandez, J. A. and Gonzalez, J.: Hierarchical graph search for mobile robot path planning, in: Internat. IEEE Conf. on Robotics and Automation (ICRA’98), Leuven, Belgium, 1998, pp. 656–661.
Fernandez, J. A. and Gonzalez, J.: Multi-Hierarchical Representation of Large-Scale Space, Kluwer Academic, Dordrecht, 2001.
Fernandez, J. A. and Gonzalez, J.: Multihierarchical graph search, IEEE Trans. Pattern Anal. Machine Intelligence 24(1) (2002), 103–113.
Hamidzadeh, B. and Shekhar, S.: Dynora II: A real-time planning algorithm, J. Artificial Intelligence Tools (Special Issue on Real-Time AI) 2(1) (1993), 93–115.
Holte, R. C., Drummond, C., and Perez, M. B.: Searching with abstractions: A unifying framework and new high-performance algorithm, in: Proc. of the 10th Canadian Conf. on Artificial Intelligence, Morgan Kaufman, 1994, pp. 263–270.
Holte, R. C., Perez, M. B., Zimmer, R. M. and MacDonald, A. J.: The tradeoff between speed and optimality in hierarchical search, Technical Report, School of Information Technology and Engineering, University of Ottawa, Canada, 1995.
Hyun, W. K. and Suh, I. H.: A hierarchical collision-free path planning algorithm for robotics, in: Intelligent Robots and Systems 95, Proc. 1995 IEEE/RSJ Internat. Conf. on ‘Human Robot Interaction and Cooperative Robots’, Vol. 2, 1995, pp. 448–495.
Jing, N., Huang, Y.-W., and Rundensteiner, E. A.: Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation, IEEE Trans. Knowledge Data Engrg. 10(3) (1998), 409–432.
Kanoh, H., Kashiwazaki, A., Bui, L. T. H., Nishihara, S., and Kato, N.: Real-time route selection using genetic algorithms for car navigation systems, in: IEEE Internat. Conf. on Intelligent Vehicles, 1998, pp. 207–212.
Knoblock, C. A.: Learning abstraction hierarchies for problem solving, in: T. Dietterich and W. Swartout (eds), Proc. of the 8th National Conf. on Artificial Intelligence, AAAI Press, Menlo Park, CA, 1990, pp. 923–928.
Korf, R. E.: Real-time heuristic search, Artificial Intelligence 41–42 (1990), 189–211.
Latombe, J. C.: Robot Motion Planning, Kluwer Academic, Dordrecht, 1990.
Sasaki, T., Chimura, F., and Tokoro, M.: The Trailblazer search with a hierarchical abstract map, in: Proc. of the 14th Internat. Joint Conf. on Artificial Intelligence, Montreal, Canada, 1995, pp. 259–265.
Stentz, A.: Optimal and efficient path planning for partially-known environments, in: Proc. of the IEEE Internat. Conf. on Robotics and Automation (ICRA’94), Vol. 4, 1994, pp. 3310–3317.
Sugihara, K. and Smith, J.: Genetic algorithms for adaptative planning of path and trajectory of a mobile robot in 2D terrains, IEICE Trans. Inform. Systems E82-D(1) (1999), 309–317.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Cagigas, D., Abascal, J. A Hierarchical Extension of the D* Algorithm. J Intell Robot Syst 42, 393–413 (2005). https://doi.org/10.1007/s10846-005-2962-x
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s10846-005-2962-x