Sciweavers

252 search results - page 3 / 51
» Efficient Planning of Informative Paths for Multiple Robots
Sort
View
STAIRS
2008
143views Education» more  STAIRS 2008»
13 years 7 months ago
Domain-Dependent View of Multiple Robots Path Planning
We study a problem of path planning for a group of robots in this paper. The problem is stated as a finding of spatial-temporal paths through which the robots can go from their ini...
Pavel Surynek
AUTOMATICA
2010
99views more  AUTOMATICA 2010»
13 years 6 months ago
Continuous trajectory planning of mobile sensors for informative forecasting
This paper addresses planning of continuous paths for mobile sensors to reduce uncertainty in some quantities of interest in the future. The mutual information between the measure...
Han-Lim Choi, Jonathan P. How
RAS
1998
145views more  RAS 1998»
13 years 6 months ago
Coordinated path planning for multiple robots
We present a new approach to the multi-robot path planning problem, where a number of robots are to change their positions through feasible motions in the same static environment....
Petr Svestka, Mark H. Overmars
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
13 years 4 months ago
Multi-agent path planning with multiple tasks and distance constraints
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
Subhrajit Bhattacharya, Maxim Likhachev, Vijay Kum...
IWANN
1997
Springer
13 years 10 months ago
Dynamic Path Planning with Spiking Neural Networks
: The path planning problem is relevant for all applications in which a mobil robot should autonomously navigate. Finding the shortest path in an environment that is only partialy ...
Ulrich Roth, Marc Walker, Arne Hilmann, Heinrich K...