Sciweavers

2796 search results - page 219 / 560
» The coolest path problem
Sort
View
GECCO
2008
Springer
137views Optimization» more  GECCO 2008»
15 years 7 months ago
Evolutionary path planner for UAVs in realistic environments
This paper presents a path planner for Unmanned Air Vehicles (UAVs) based on Evolutionary Algorithms (EA) that can be used in realistic risky scenarios. The path returned by the a...
Jesús Manuel de la Cruz, Eva Besada-Portas,...
IJRR
2008
75views more  IJRR 2008»
15 years 6 months ago
Planning Time-Minimal Safe Paths Amidst Unpredictably Moving Obstacles
In this paper we discuss the problem of planning safe paths amidst unpredictably moving obstacles in the plane. Given the initial positions and the maximum speeds of the moving ob...
Jur P. van den Berg, Mark H. Overmars
IJCAI
1989
15 years 7 months ago
Solving Time-Dependent Planning Problems
A planning problem is time-dependent, if the time spent planning affects the utility of the system's performance. In [Dean and Boddy, 1988], we define a framework for constru...
Mark S. Boddy, Thomas Dean
STOC
2003
ACM
153views Algorithms» more  STOC 2003»
16 years 6 months ago
Sublinear geometric algorithms
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
Bernard Chazelle, Ding Liu, Avner Magen
WEA
2007
Springer
108views Algorithms» more  WEA 2007»
16 years 21 days ago
Engineering Algorithms for Approximate Weighted Matching
We present a systematic study of approximation algorithms for the maximum weight matching problem. This includes a new algorithm which provides the simple greedy method with a rece...
Jens Maue, Peter Sanders