Sciweavers

179 search results - page 17 / 36
» Using Classical Planners to Solve Nondeterministic Planning ...
Sort
View
120
Voted
ESWA
2007
100views more  ESWA 2007»
15 years 1 months ago
Using memetic algorithms with guided local search to solve assembly sequence planning
The goal of assembly planning consists in generating feasible sequences to assemble a product and selecting an efficient assembly sequence from which related constraint factors su...
Hwai-En Tseng, Wen-Pai Wang, Hsun-Yi Shih
111
Voted
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
15 years 8 months ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
JAIR
2006
179views more  JAIR 2006»
15 years 1 months ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert
118
Voted
ECAI
2004
Springer
15 years 7 months ago
IPSS: A Hybrid Reasoner for Planning and Scheduling
In this paper we describe IPSS (Integrated Planning and Scheduling System), a domain independent solver that integrates an AI heuristic planner, that synthesizes courses of actions...
María Dolores Rodríguez-Moreno, Ange...
GECCO
2008
Springer
137views Optimization» more  GECCO 2008»
15 years 3 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,...