111 search results - page 14 / 23 » Anytime Path Planning and Replanning in Dynamic Environments |
CDC
2008
IEEE
15 years 3 months ago
2008
IEEE
— The Tunnel-MILP algorithm is a three stage path planning method for 2-D environments that relies on the identification of a sequence of convex polygons to form an obstacle fre...
AAAI
2010
14 years 11 months ago
2010
Goal-directed path planning is one of the basic and widely studied problems in the field of mobile robotics. Homotopy classes of trajectories, arising due to the presence of obsta...
IROS
2008
IEEE
15 years 3 months ago
2008
IEEE
Abstract— Many planning approaches adhere to the twotiered architecture consisting of a long-range, low fidelity global planner and a short-range high fidelity local planner. W...
91
Voted
AAAI
2007
14 years 11 months ago
2007
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
In this paper we consider the problem of eCommerce comparison shopping agents (shopbots) that are limited by capacity constraints. In light of the phenomenal increase both in dema...