Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Chapter

Download BibTeX

Title

Informed Guided Rapidly-exploring Random Trees*-Connect for Path Planning of Walking Robots

Authors

[ 1 ] Instytut Robotyki i Inteligencji Maszynowej, Wydział Automatyki, Robotyki i Elektrotechniki, Politechnika Poznańska | [ P ] employee

Scientific discipline (Law 2.0)

[2.2] Automation, electronics, electrical engineering and space technologies

Year of publication

2022

Chapter type

chapter in monograph / paper

Publication language

english

Abstract

EN In this paper, we deal with the problem of full-body path planning for walking robots. The state of walking robots is defined in multi-dimensional space. Path planning requires defining the path of the feet and the robot's body. Moreover, the planner should check multiple constraints like static stability, self-collisions, collisions with the terrain, and the legs' workspace. As a result, checking the feasibility of the potential path is time-consuming and influences the performance of a planning method. In this paper, we verify the feasibility of sampling-based planners in the path planning task of walking robots. We identify the strengths and weaknesses of the existing planners. Finally, we propose a new planning method that improves the performance of path planning of legged robots.

Pages (from - to)

709 - 714

Physical description

4 001,12; środki finansowe przyznane na realizację projektu w zakresie badań naukowych lub prac rozwojowych

DOI

10.1109/ICARCV57592.2022.10004330

URL

https://ieeexplore.ieee.org/document/10004330

Book

Proceedings of the 17th International Conference on Control, Automation, Robotics and Vision (ICARCV)

Presented on

17th International Conference on Control, Automation, Robotics and Vision (ICARCV 2022), 11-13.12.2022, Singapore, Singapore

Ministry points / chapter

20

Ministry points / conference (CORE)

140

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.