Path planning for four-legged walking robot using rapidly exploring random trees

Abstract eng:
There are several randomized methods for problem of path planning. Rapidly exploring random trees (RRT) is a method which can deal with constraints typical for legged walking robots, e.g. limitations in rotation step resolution. Paper describes the RRT method itself and its use for path planning of four-legged walking robot, including special failure case when robot is capable of only rotating in one direction. The method proved to be robust and fast.

• Export as: BibTeX | MARC | MARCXML | DC | EndNote | NLM | RefWorks
• Add to your basket