793 search results - page 80 / 159 » Analogical Path Planning |
AIMSA
2004
Springer
14 years 1 months ago
2004
Springer
The reward-based autobiographical memory approach has been applied to the Web search agent. The approach is based on the analogy between the Web and the environmental exploration b...
ICRA
2005
IEEE
14 years 1 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 ...
VLDB
1995
ACM
13 years 11 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...
ICRA
2009
IEEE
14 years 2 months 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...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Recent research on fast route planning algorithms focused either on road networks or on public transportation. However, on the long run, we are interested in planning routes in a m...