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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput. Surv. 35(3), 268–308 (2003)
Brucker, P., Drexl, A., Mohring, R., Neumann, K., Pesch, E.: Resource-Constrained Project Scheduling: Notation, Classification, Models, and Methods. European Journal of Operations Research 112(1), 3–41 (1999)
Cesta, A., Oddi, A., Smith, S.F.: A constraint-based method for project scheduling with time windows. J. Heuristics 8(1), 109–136 (2002)
Cheng, C., Smith, S.F.: Generating Feasible Schedules under Complex Metric Constraints. In: Proceedings 12th National Conference on AI, AAAI 1994 (1994)
Laborie, P., Godard, D.: Self-Adapting Large Neighborhood Search: Application to Single-Mode Scheduling Problems. In: Proc. of the Multidisciplinary International Scheduling Conference: Theory & Applications, MISTA 2007 (2007)
Montanari, U.: Networks of Constraints: Fundamental Properties and Applications to Picture Processing. Information Sciences 7, 95–132 (1974)
Muscettola, N., Nayak, P., Pell, B., Williams, B.C.: Remote Agents: To Boldly Go Where No AI Systems Has Gone Before. Artificial Intelligence 103(1-2), 5–48 (1998)
Oddi, A., Rasconi, R., Cesta, A., Smith, S.F.: Iterative-Sampling Search for Job Shop Scheduling with Setup Times. In: COPLAS 2009, Proc. of the Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems at ICAPS (2009)
Oddi, A., Smith, S.F.: Stochastic Procedures for Generating Feasible Schedules. In: Proceedings 14th National Conference on AI (AAAI 1997), pp. 308–314 (1997)
Oddi, A., Cesta, A., Policella, N., Smith, S.F.: Combining Variants of Iterative Flattening Search. Journal of Engineering Applications of Artificial Intelligence 21, 683–690 (2008)
Smith, S.F., Cheng, C.: Slack-Based Heuristics for Constraint Satisfaction Scheduling. In: Proceedings 11th National Conference on AI, AAAI 1993 (1993)
Van Hentenryck, P.: The OPL Optimization Programming Language. MIT Press, Cambridge (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Díaz, D., R-Moreno, M.D., Cesta, A., Oddi, A., Rasconi, R. (2011). Scheduling a Single Robot in a Job-Shop Environment through Precedence Constraint Posting. In: Mehrotra, K.G., Mohan, C.K., Oh, J.C., Varshney, P.K., Ali, M. (eds) Modern Approaches in Applied Intelligence. IEA/AIE 2011. Lecture Notes in Computer Science(), vol 6704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21827-9_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-21827-9_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21826-2
Online ISBN: 978-3-642-21827-9
eBook Packages: Computer ScienceComputer Science (R0)