Sciweavers

622 search results - page 13 / 125
» Solving the Robots Gathering Problem
Sort
View
ICTAI
2010
IEEE
13 years 5 months ago
Metropolis Particle Swarm Optimization Algorithm with Mutation Operator for Global Optimization Problems
When a local optimal solution is reached with classical Particle Swarm Optimization (PSO), all particles in the swarm gather around it, and escaping from this local optima becomes...
Lhassane Idoumghar, M. Idrissi-Aouad, Mahmoud Melk...
TROB
2008
112views more  TROB 2008»
13 years 7 months ago
A Complete and Scalable Strategy for Coordinating Multiple Robots Within Roadmaps
Abstract--This paper addresses the challenging problem of finding collision-free trajectories for many robots moving toward individual goals within a common environment. Most popul...
Mike Peasgood, Christopher M. Clark, John McPhee
ICRA
2005
IEEE
88views Robotics» more  ICRA 2005»
14 years 1 months ago
Loop Closing in Topological Maps
— In order to create consistent maps of unknown environments, a robot must be able to recognize when it has returned to a previously visited place. In this paper, we introduce an...
Kristopher R. Beevers, Wesley H. Huang
EPIA
2005
Springer
14 years 1 months ago
Acquiring Observation Models Through Reverse Plan Monitoring
We present a general-purpose framework for updating a robot’s observation model within the context of planning and execution. Traditional plan execution relies on monitoring plan...
Sonia Chernova, Elisabeth Crawford, Manuela M. Vel...
ICRA
2008
IEEE
117views Robotics» more  ICRA 2008»
14 years 2 months ago
Tracking hidden agents through shadow information spaces
— This paper addresses problems of inferring the locations of moving agents from combinatorial data extracted by robots that carry sensors. The agents move unpredictably and may ...
Jingjin Yu, Steven M. LaValle