VerticalNews Robotics & Machine Learning
Welcome to VerticalNews!
RECEIVE OUR FREE NEWSLETTERON ROBOTICS & MACHINE LEARNING
New findings in computer science described from University of Gdansk
August 4th, 2008
"Consider the following safe path planning problem: Given a set of trajectories (paths) of k point robots with maximum unit speed in a bounded region over a (long) time interval [0, T], find another trajectory (if it exists) subject to the same maximum unit speed limit, that avoids (that is, stays at a safe distance of) each of the other k trajectories over the entire time interval. We call this variant the continuous model of the safe path planning problem," scientists in Gdansk, Poland report.
"The discrete model of this problem is: Given a set of trajectories (paths) of k point robots in a graph over a (long) time interval 0, 1, 2,..., T, find a trajectory (path) for...
Click here for more articles from Computer Science
Source: VerticalNews Robotics & Machine Learning (2008-08-04)