810 search results - page 85 / 162 » Solving Time-Dependent Planning Problems |
IROS
2007
IEEE
14 years 2 months ago
2007
IEEE
— This paper addresses the problem of planning for goal directed navigation in the environment that contains a number of possible adversary locations. It first shows that common...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we present a genetic algorithm applied to the problem of mission planning for Joint Suppression of Enemy Air Defenses (JSEAD) in support of air strike operations. Th...
IAT
2006
IEEE
14 years 2 months ago
2006
IEEE
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, the merging of tw...
UAI
2008
13 years 9 months ago
2008
Planning can often be simplified by decomposing the task into smaller tasks arranged hierarchically. Charlin et al. [4] recently showed that the hierarchy discovery problem can be...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We address the problem of representing big sets of binary constraints compactly. Binary constraints in the form of 2literal clauses are ubiquitous in propositional formul...