Sciweavers

638 search results - page 8 / 128
» A New Approach to Tractable Planning
Sort
View
ICRA
2003
IEEE
122views Robotics» more  ICRA 2003»
14 years 23 days ago
A novel potential-based path planning of 3-D articulated robots with moving bases
This paper proposes a novel path planning algorithm of 3-D articulated robots with moving bases based on a generalized potential field model. The approach computes, similar to th...
Chien-Chou Lin, Chi-Chun Pan, Jen-Hui Chuang
AAAI
2012
11 years 10 months ago
The Complexity of Planning Revisited - A Parameterized Analysis
The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (B¨ackstr¨om and Nebel) have influenced followin...
Christer Bäckström, Yue Chen, Peter Jons...
AI
2008
Springer
13 years 7 months ago
An approach to efficient planning with numerical fluents and multi-criteria plan quality
Dealing with numerical information is practically important in many real-world planning domains where the executability of an action can depend on certain numerical conditions, an...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina
EVOW
2006
Springer
13 years 11 months ago
Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning
An original approach, termed Divide-and-Evolve is proposed to hybridize Evolutionary Algorithms (EAs) with Operational Research (OR) methods in the domain of Temporal Planning Prob...
Marc Schoenauer, Pierre Savéant, Vincent Vi...
ICCD
2004
IEEE
106views Hardware» more  ICCD 2004»
14 years 4 months ago
A New Statistical Optimization Algorithm for Gate Sizing
— In this paper, we approach the gate sizing problem in VLSI circuits in the context of increasing variability of process and circuit parameters as technology scales into the nan...
Murari Mani, Michael Orshansky