Sciweavers

2968 search results - page 87 / 594
» Network Programming Using PLAN
Sort
View
FLAIRS
2009
14 years 12 months ago
Dynamic Programming Approximations for Partially Observable Stochastic Games
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...
Akshat Kumar, Shlomo Zilberstein
SARA
2009
Springer
15 years 8 months ago
Common Subexpressions in Constraint Models of Planning Problems
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Grego...
107
Voted
ICRA
2010
IEEE
157views Robotics» more  ICRA 2010»
15 years 19 days ago
Integrated planning and control of large tracked vehicles in open terrain
Abstract— Trajectory generation and control of large equipment in open field environments involves systematically and robustly operating in uncertain and dynamic terrain. This p...
Xiuyi Fan, Surya Singh, Florian Oppolzer, Eric Net...
RAS
2010
117views more  RAS 2010»
15 years 16 days ago
Extending BDI plan selection to incorporate learning from experience
An important drawback to the popular Belief, Desire, and Intentions (BDI) paradigm is that such systems include no element of learning from experience. We describe a novel BDI exe...
Dhirendra Singh, Sebastian Sardiña, Lin Pad...
94
Voted
DAC
2007
ACM
16 years 3 months ago
TROY: Track Router with Yield-driven Wire Planning
In this paper, we propose TROY, the first track router with yield-driven wire planning to optimize yield loss due to random defects. As the probability of failure (POF) computed f...
Minsik Cho, Hua Xiang, Ruchir Puri, David Z. Pan