Publication detail

RRTs Review and Statistical Analysis

ABBADI, A. MATOUŠEK, R.

English title

RRTs Review and Statistical Analysis

Type

Peer-reviewed article not indexed in WoS or Scopus

Language

en

Original abstract

Path planning is one of the important issues in robotics area. There are many ideas to deal with this issue one of them is RRT (Rapidly Exploring Random Tree). This method is not optimal but it reduces the time needed for obtaining solutions. This algorithm is based on portability, the result of this algorithm is a tortuous path which has a lot of useless points. In this paper we introduce some variants of RRTs and a method for reduce a degree of tortuous, making the path shorter and omitting useless points. Also because of RRTs randomizes we make some statistical test on many variations of RRT, to make decisions about the best variations.

Keywords in English

RRT, Rapidly Exploring Random Tree, Path Planning, Path optimizing, RRT Statistic.

Released

2012-02-17

Publisher

NAUN

Location

Spojené státy americké

ISSN

1998-0159

Volume

6

Number

1

Pages from–to

1–8

Pages count

8

BIBTEX


@article{BUT89679,
  author="Ahmad {Abbadi} and Radomil {Matoušek}",
  title="RRTs Review and Statistical Analysis",
  journal="International Journal of Mathematics and Computers in Simulation",
  year="2012",
  volume="6",
  number="1",
  pages="1--8",
  issn="1998-0159"
}