Sciweavers

408 search results - page 10 / 82
» A lookahead strategy for solving large planning problems
Sort
View
AAAI
1994
14 years 11 months ago
GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement
New approaches to solving constraint satisfaction problems using iterative improvement techniques have been found to be successful on certain, very large problems such as the mill...
Andrew J. Davenport, Edward P. K. Tsang, Chang J. ...
67
Voted
SG
2005
Springer
15 years 3 months ago
A Smart Algorithm for Column Chart Labeling
This paper presents a smart algorithm for labeling column charts and their derivatives. To efficiently solve the problem, we separate it into two sub-problems. We first present a ...
Sebastian Müller, Arno Schödl
86
Voted
IROS
2006
IEEE
217views Robotics» more  IROS 2006»
15 years 3 months ago
Active SLAM using Model Predictive Control and Attractor based Exploration
– Active SLAM poses the challenge for an autonomous robot to plan efficient paths simultaneous to the SLAM process. The uncertainties of the robot, map and sensor measurements, a...
Cindy Leung, Shoudong Huang, Gamini Dissanayake
AGENTS
1997
Springer
15 years 1 months ago
Progressive Negotiation For Time-Constrained Autonomous Agents
We address in this paper a problem of autonomous agents performing in a common environment where each agent has its goal to achieve before a given deadline. Agents must be able to...
Abdel-Illah Mouaddib
EXPERT
2007
109views more  EXPERT 2007»
14 years 9 months ago
Mexar2: AI Solves Mission Planner Problems
s planners work at a higher abstraction level while it performs low-level, often-repetitive tasks. It also helps them produce a plan rapidly, explore alternative solutions, and cho...
Amedeo Cesta, Gabriella Cortellessa, Michel Denis,...