80 search results - page 4 / 16 » Localizing a Robot with Minimum Travel |
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— We derive a local minimum of an elastic potential energy due to the deformation of a hemispherical soft fingertip, and propose a quasi-static manipulation algorithm us...
GECCO
2011
Springer
12 years 11 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
ICRA
2002
IEEE
14 years 11 days ago
2002
IEEE
In this paper we present an approach to obstacle avoidance and local path planning for polygonal robots. It decomposes the task into a model stage and a planning stage. The model ...
ALENEX
2001
13 years 8 months ago
2001
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
DISOPT
2010
13 years 7 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...