Sciweavers

622 search results - page 18 / 125
» Solving the Robots Gathering Problem
Sort
View
NIPS
2004
13 years 9 months ago
A Machine Learning Approach to Conjoint Analysis
Choice-based conjoint analysis builds models of consumer preferences over products with answers gathered in questionnaires. Our main goal is to bring tools from the machine learni...
Olivier Chapelle, Zaïd Harchaoui
ICRA
2007
IEEE
138views Robotics» more  ICRA 2007»
14 years 2 months ago
Barrier Coverage for Variable Bounded-Range Line-of-Sight Guards
Abstract— In this paper, we formalize the problem of barrier coverage, that is, the problem of preventing undetected intrusion in a particular region using robot sensors. We solv...
Stephen Kloder, Seth Hutchinson
HRI
2009
ACM
14 years 2 months ago
Planning as an architectural control mechanism
We describe recent work on PECAS, an architecture for intelligent robotics that supports multi-modal interaction. Categories and Subject Descriptors I.2.8 [Computing Methodologies...
Nick Hawes, Michael Brenner, Kristoffer Sjö&o...
TASE
2010
IEEE
13 years 2 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
GLOBECOM
2006
IEEE
14 years 1 months ago
Secure Aggregation in Large Scale Overlay Networks
Overlay networks have been very useful in solving large scale data dissemination problems. In this paper, we consider the case of data gathering which is the inverse of disseminat...
Waseem Ahmad, Ashfaq A. Khokhar