Sciweavers

810 search results - page 65 / 162
» Solving Time-Dependent Planning Problems
Sort
View
SEMWEB
2010
Springer
13 years 6 months ago
Auto-experimentation of KDD Workflows Based on Ontological Planning
One of the problems of Knowledge Discovery in Databases (KDD) is the lack of user support for solving KDD problems. Current Data Mining (DM) systems enable the user to manually des...
Floarea Serban
HAIS
2008
Springer
13 years 9 months ago
Estimation Using Differential Evolution for Optimal Crop Plan
This paper presents an application of Differential Evolution (DE) to determine optimal crop plan for command area of Pamba-Achankovil-Vaippar (PAV) link project, so as to maximize ...
Millie Pant, Radha Thangaraj, Deepti Rani, Ajith A...
ICRA
2008
IEEE
112views Robotics» more  ICRA 2008»
14 years 2 months ago
Balancing exploration and exploitation in motion planning
— Computationally efficient motion planning must avoid exhaustive exploration of configuration space. We argue that this can be accomplished most effectively by carefully balan...
Markus Rickert, Oliver Brock, Alois Knoll
DCG
2000
104views more  DCG 2000»
13 years 8 months ago
Efficient Algorithms for Approximating Polygonal Chains
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
Pankaj K. Agarwal, Kasturi R. Varadarajan
CDC
2010
IEEE
170views Control Systems» more  CDC 2010»
13 years 3 months ago
Motion planning with hybrid dynamics and temporal goals
In this paper, we consider the problem of motion planning for mobile robots with nonlinear hybrid dynamics, and high-level temporal goals. We use a multi-layered synergistic framew...
Amit Bhatia, Lydia E. Kavraki, Moshe Y. Vardi