| Author(s): Dr Adel Akbarimajd , Mr Akbar Hassan Zadeh |
|
| Study Type: Research | Subject: Special |
|
| Article abstract: |
| In path planning of mobile robots dealing with concave obstacles is a major challenge. More specifically in real-time planning where there is no complete representation of the environment, this challenge would be much more problematic. In such cases local minimums and high computations cost are the most important problems. In this paper, in order to reduce computational cost, cellular automata as a distributed computational method with parallel processing properties is employed as tool for path planning purposes. The environment of the robot is modeled as a two dimensional cellular automata with four states. Evolutionary rules of the automata are proposed to perform the planning task. The proposed method is appropriate for single robot systems as well as multi robot systems. The proposed method is afterwards extended to be employed for concave obstacles using a ant colony inspired technique. The most superior advantage of the proposed method is its capability of real-time path planning of mobile robots with no need to prior representation of the environment. |
|
| Keywords: Key words: Ant colony algorithm, Cellular Automata, Mobile robots, Multi robot systems, Path planning, |
|
| Full text [PDF 500 kb] |
|
| |
|
| How to cite this article |
Download citation data for: BibTeX | EndNote | Medlars | ProCite | Reference Manager | RefWorks |
Send citation data to: CiteULike | RefWorks | |
| |
| |
|
| Send email to the article author |
| |
|
| Add your comments about this article |
| |
|
