Scheduling a single robot in a job-shop environment through precedence constraint posting

Authors:
D. Díaz;M. D. R-Moreno;A. Cesta;A. Oddi;R. Rasconi
Affiliations:
Universidad de Alcala, Alcala de Henares, Madrid, Spain;Universidad de Alcala, Alcala de Henares, Madrid, Spain;ISTC-CNR, Italian National Research Council, Rome, Italy;ISTC-CNR, Italian National Research Council, Rome, Italy;ISTC-CNR, Italian National Research Council, Rome, Italy
Venue:
IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II
Year:
2011

Citing 8
Cited 0

Generating feasible schedules under complex metric constraints

AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Remote Agent: to boldly go where no AI system has gone before

Artificial Intelligence - Special issue: artificial intelligence 40 years later
The OPL optimization programming language

The OPL optimization programming language
A Constraint-Based Method for Project Scheduling with Time Windows

Journal of Heuristics
Metaheuristics in combinatorial optimization: Overview and conceptual comparison

ACM Computing Surveys (CSUR)
Combining variants of iterative flattening search

Engineering Applications of Artificial Intelligence
Slack-based heuristics for constraint satisfaction scheduling

AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Stochastic procedures for generating feasible schedules

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents recent work on using robust state-of-the-art AI Planning and Scheduling (P&S) techniques to provide autonomous capabilities in a space robotic domain. We have defined a simple robotic scenario, reduced it to a known scheduling problem which is addressed here with a constraint-based, resource-driven reasoner. We present an initial experimentation that compares different meta-heuristic algorithms.