Sciweavers

622 search results - page 50 / 125
» Solving the Robots Gathering Problem
Sort
View
CP
2003
Springer
14 years 1 months ago
Open Constraint Optimization
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
Boi Faltings, Santiago Macho-Gonzalez
AI
2001
Springer
14 years 11 days ago
Search Techniques for Non-linear Constraint Satisfaction Problems with Inequalities
In recent years, interval constraint-based solvers have shown their ability to efficiently solve challenging non-linear real constraint problems. However, most of the working syst...
Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Falt...
FAABS
2004
Springer
14 years 1 months ago
Two Formal Gas Models for Multi-agent Sweeping and Obstacle Avoidance
Abstract. The task addressed here is a dynamic search through a bounded region, while avoiding multiple large obstacles, such as buildings. In the case of limited sensors and commu...
Wesley Kerr, Diana F. Spears, William M. Spears, D...
ISER
2004
Springer
104views Robotics» more  ISER 2004»
14 years 1 months ago
Wave-shape pattern control of electroactive polymer gel robots
Abstract. This paper proposes wave-shape pattern control method for whole-body deformable robots containing electroactive polymers. Mechanisms consisting of a typical electroactive...
Mihoko Otake, Yoshihiko Nakamura, Masayuki Inaba, ...
OPODIS
2003
13 years 9 months ago
Multiple Agents RendezVous in a Ring in Spite of a Black Hole
The Rendezvous of anonymous mobile agents in a anonymous network is an intensively studied problem; it calls for k anonymous, mobile agents to gather in the same site. We study thi...
Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe,...