Sciweavers

1464 search results - page 20 / 293
» Optimal Planning with ACO
Sort
View
AIPS
2010
13 years 10 months ago
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
Hootan Nakhost, Martin Müller 0003
AAAI
2000
13 years 9 months ago
Gridworlds as Testbeds for Planning with Incomplete Information
Gridworlds are popular testbeds for planning with incomplete information but not much is known about their properties. We study a fundamental planning problem, localization, to in...
Craig A. Tovey, Sven Koenig
AIPS
2009
13 years 8 months ago
Optimality Properties of Planning Via Petri Net Unfolding: A Formal Analysis
We provide a theoretical analysis of planning via Petri net unfolding, a novel technique for synthesising parallel plans. Parallel plans are generally valued for their execution f...
Sarah L. Hickmott, Sebastian Sardiña
AIPS
2010
13 years 10 months ago
Cost-Optimal Factored Planning: Promises and Pitfalls
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
Eric Fabre, Loig Jezequel, Patrik Haslum, Sylvie T...
ANTSW
2004
Springer
14 years 1 months ago
S-ACO: An Ant-Based Approach to Combinatorial Optimization Under Uncertainty
A general-purpose, simulation-based algorithm S-ACO for solving stochastic combinatorial optimization problems by means of the ant colony optimization (ACO) paradigm is investigate...
Walter J. Gutjahr