200 search results - page 9 / 40 » Minimizing Response Times in Real Time Planning and Search |
154
click to vote
IROS
2007
IEEE
16 years 10 days ago
2007
IEEE
— Motion planning for robotic arms is important for real, physical world applications. The planning for arms with high-degree-of-freedom (DOF) is hard because its search space is...
174
click to vote
ICTAI
2003
IEEE
2003
IEEE
Partitioning of Temporal Planning Problems in Mixed Space Using the Theory of Extended Saddle Points
15 years 11 months ago
We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subpr...
165
click to vote
IROS
2006
IEEE
16 years 2 days ago
2006
IEEE
- We are conducting research and development in technology for unifying the information of a large number of intelligent sensors distributed in a disaster-stricken area. Operating ...
169
click to vote
WSC
2007
15 years 8 months ago
2007
The problem of path planning for Unmanned Aerial Vehicles (UAV) with a tracking mission, when some a priori information about the targets and the environment is available can in s...
170
click to vote
FLAIRS
2008
15 years 8 months ago
2008
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...