Computer Science – Artificial Intelligence
Scientific paper
2009-12-01
Computer Science
Artificial Intelligence
54 pages, Master of Science in Informatics Engineering thesis
Scientific paper
This document is a thesis on the subject of single-agent on-line path planning in continuous,unpredictable and highly dynamic environments. The problem is finding and traversing a collision-free path for a holonomic robot, without kinodynamic restrictions, moving in an environment with several unpredictably moving obstacles or adversaries. The availability of perfect information of the environment at all times is assumed. Several static and dynamic variants of the Rapidly Exploring Random Trees (RRT) algorithm are explored, as well as an evolutionary algorithm for planning in dynamic environments called the Evolutionary Planner/Navigator. A combination of both kinds of algorithms is proposed to overcome shortcomings in both, and then a combination of a RRT variant for initial planning and informed local search for navigation, plus a simple greedy heuristic for optimization. We show that this combination of simple techniques provides better responses to highly dynamic environments than the RRT extensions.
No associations
LandOfFree
Single-Agent On-line Path Planning in Continuous, Unpredictable and Highly Dynamic Environments does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Single-Agent On-line Path Planning in Continuous, Unpredictable and Highly Dynamic Environments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Single-Agent On-line Path Planning in Continuous, Unpredictable and Highly Dynamic Environments will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-508001