Sciweavers

655 search results - page 56 / 131
» Evolving Heuristics for Planning
Sort
View
ICML
1990
IEEE
15 years 3 months ago
Explanations of Empirically Derived Reactive Plans
Given an adequate simulation model of the task environment and payoff function that measures the quality of partially successful plans, competition-based heuristics such as geneti...
Diana F. Gordon, John J. Grefenstette
UAI
2003
15 years 1 months ago
Symbolic Generalization for On-line Planning
Symbolic representations have been used successfully in off-line planning algorithms for Markov decision processes. We show that they can also improve the performance of online p...
Zhengzhu Feng, Eric A. Hansen, Shlomo Zilberstein
IROS
2009
IEEE
154views Robotics» more  IROS 2009»
15 years 6 months ago
Graph signature for self-reconfiguration planning of modules with symmetry
— In our previous works we had developed a framework for self-reconfiguration planning based on graph signature and graph edit-distance. The graph signature is a fast isomorphism...
Masoud Asadpour, Mohammad Hassan Zokaei Ashtiani, ...
OR
2007
Springer
15 years 6 months ago
A Decision Support System for Planning Promotion Time Slots
We report on the development of a Decision Support System (DSS) to plan the best assignment for the weekly promotion space of a TV station. Each product to promote has a given tar...
Paulo A. Pereira, Fernando A. C. C. Fontes, Dalila...
ICRA
2005
IEEE
118views Robotics» more  ICRA 2005»
15 years 5 months ago
Learning-Assisted Multi-Step Planning
— Probabilistic sampling-based motion planners are unable to detect when no feasible path exists. A common heuristic is to declare a query infeasible if a path is not found in a ...
Kris K. Hauser, Timothy Bretl, Jean-Claude Latombe