A Parallel Processor Algorithm for Robot Route Planning
Proceedings of the Eighth International Joint Conference on Artificial Intelligence. Robotics. Pages 827-828.
Abstract
This paper presents a fast, uniform, parallel search algorithm for robot route planning and obstacle avoidance. The algorithm is equally applicable to real or synthetic data and overcomes many problems associated with other route finding methods, The time taken to generate a route through a an arbitrarily complex environment hasbeen reduced to an insignificant fraction of the time taken for the robot to traverse the route. Furthermore the time taken to create the route is independent of environment complexity and only linearly proportional to route length. Actual results and timings from running the algorithm on the ICL Distributed Array Processor and executing the resultant path on a mobile robot are presented.
@inproceedings{ijcai1983p199,
title = {A Parallel Processor Algorithm for Robot Route Planning},
author = {Witkowski, C. M.},
booktitle = {Proceedings of the Eighth International Joint Conference on
Artificial Intelligence, {IJCAI-83}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Alan Bundy},
pages = {827--828},
year = {1983},
note = {Robotics},
url = {https://ijcai.org/proceedings/1983/199},
}
TY - CPAPER TI - A Parallel Processor Algorithm for Robot Route Planning AU - Witkowski, C. M. T2 - Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI-83 PB - International Joint Conferences on Artificial Intelligence PY - 1983 SP - 827 EP - 828 UR - https://ijcai.org/proceedings/1983/199 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
