Topological complexity of collision free motion planning algorithms in the presence of multiple moving obstacles

Mathematics – Optimization and Control

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We study motion planning algorithms for collision free control of multiple
objects in the presence of moving obstacles. We compute the topological
complexity of algorithms solving this problem. We apply topological tools and
use information about cohomology algebras of configuration spaces. The results
of the paper may potentially be used in systems of automatic traffic control.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Topological complexity of collision free motion planning algorithms in the presence of multiple moving obstacles 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 Topological complexity of collision free motion planning algorithms in the presence of multiple moving obstacles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Topological complexity of collision free motion planning algorithms in the presence of multiple moving obstacles will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-704808

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.