696 search results - page 73 / 140 » Planning for Network-Aware Paths |
168
click to vote
ICRA
2005
IEEE
15 years 11 months ago
2005
IEEE
— When navigating in an unknown environment for the first time, a natural behavior consists in memorizing some key views along the performed path, in order to use these referenc...
173
click to vote
JAIR
2006
15 years 5 months ago
2006
In this paper, we present the partitioning of mutual-exclusion (mutex) constraints in temporal planning problems and its implementation in the SGPlan4 planner. Based on the strong...
139
click to vote
ICRA
2005
IEEE
15 years 11 months ago
2005
IEEE
— The E∗ algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation. It calculates a navigation function as a sampling of ...
172
click to vote
VLDB
1995
ACM
15 years 9 months ago
1995
ACM
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...
147
click to vote
ICRA
2009
IEEE
16 years 16 days ago
2009
IEEE
— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency o...