A GRAPH-SEARCH APPROACH ON RESOURCE-CONSTRAINED SCHEDULING PROBLEMS AND ITS APPLICATION TO ADVANCED DRIVER ASSISTANCE SYSTEMS

Christoph Endres, Christian Müller

Abstract

In this paper we present a problem which is a variation of the resource-constrained project scheduling problem and a graph-based approach to solve it. The problem is defined as resource-constrained scheduling problem (RCSP). Particularly, we apply the approach to the problem of scheduling a large number of driver warnings based on car-to-car communication (also known as cooperative vehicles). Data is presented from the project SIMTD , a large-scale field test in the area of the Hessian city of Frankfurt, where 120 cars participate in a number of controlled tests in three main scenarios: the rural road scenario (basic complexity), the motorway scenario (intermediate complexity), and the urban road scenario (high complexity). We argue that, due to its run-time behaviour, our graph-based approach is suitable for the particular application domain at hand. Results are presented in terms of quality of the solution (conflict resolution), runtime behavior and pruning effects to the size of the search tree. In addition to the scenarios derived from the actual field test, a hyper-real stress test is presented to demonstrate the performance of our solution.

References

  1. Baier, J. A., Bacchus, F., and McIlraith, S. A. (2007). A heuristic search approach to planning with temporally extended preferences. In Proce. 20th International Joint Conference on AI (IJCAI-07), pages 1808-1815.
  2. Blazewicz, J., Lenstra, J., and Kan, A. R. (1983). Scheduling subject to resource constraints: Classification and complexity. Discrete Applied Mathematics, 5:11-24.
  3. Brucker, P. and Knust, S. (2000). A linear programming and constraint propagation-based lower bound for the rcpsp. European Journal of Operational Research, 127(2):355-362.
  4. Brucker, P., Knust, S., Schoo, A., and Thiele, O. (1998). A branch and bound algorithm for the resourceconstrained project scheduling problem. European Journal of Operational Research, 107(2):272-288.
  5. Cao, Y., Mahr, A., Castronovo, S., and Müller, C. (2009). On timing and modality choice with local danger warnings for drivers. In Proc. of the 1st Intern. Conf. on Automotive User Interfaces and Interactive Vehicular Applications (AutomotiveUI 2009), pages 75-78, Essen. ACM Press.
  6. Cao, Y., Mahr, A., Castronovo, S., Theune, M., Stahl, C., and Müller, C. (2010). Local danger warnings for drivers: The effect of modality and level of assistance on driver reaction. In Proc. Intern. Conf. on Intelligent User Interfaces (IUI 2010), pages 239-248, Hong Kong. ACM.
  7. Christofides, N., Alvarez-Valdes, R., and Tamarit, J. M. (1987). Project scheduling with resource constraints: A branch and bound approach. European Journal of Operational Research, 29(3):262-273.
  8. Clausen, J., Larsen, J., Larsen, A., and Hansen, J. (2001). Disruption management - operations research between planning and execution. Technical report, Informatics and Mathematical Modelling, Technical University of Denmark, DTU, Richard Petersens Plads, Building 321, DK-2800 Kgs. Lyngby.
  9. Demassey, S., Artigues, C., and Michelon, P. (2005). Constraint-propagation-based cutting planes: An application to the resource-constrained project scheduling problem. INFORMS JOURNAL ON COMPUTING, 17:52-65.
  10. Garey, M. R. and Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NPCompleteness (Series of Books in the Mathematical Sciences). W. H. Freeman, first edition edition.
  11. Johnson, T. (1967). An algorithm for the resourceconstrained project scheduling problem. PhD thesis, M.I.T., Boston.
  12. Kuster, J., Jannach, D., and Friedrich, G. (2007). Handling alternative activities in resource-constrained project scheduling problems. In Proc of 20th Intern. Joint Conference on AI (IJCAI-07), pages 1960-1965.
  13. Mahr, A., Cao, Y., Theune, M., Schwartz, T., and Müller, C. (2010). What if it Suddenly Fails? Behavioural Aspects of Advanced Driver Assistant Systems on the Example of Local Danger Alerts. In Proc. 19th Europ. Conf. on AI (ECAI 2010), pages 1051-1052, Lisbon. IOS Press, Amsterdam.
  14. Patterson, J. and Roth, G. (1976). Scheduling a project under multiple resource constraints: a zero-one programming approach. AIIE Transactions, 8:449-455.
  15. Pritsker, A. A. B., Watters, L. J., and Wolfe, P. M. (1969). Multiproject scheduling with limited resources: A zero-one programming approach. Management Science, 16:93-108.
  16. Stinson, J. P., Davis, E. W., and Khumawala, B. M. (1978). Multiple resource-constrained scheduling using branch and bound. IIE Transactions, 10:252-259.
Download


Paper Citation


in Harvard Style

Endres C. and Müller C. (2012). A GRAPH-SEARCH APPROACH ON RESOURCE-CONSTRAINED SCHEDULING PROBLEMS AND ITS APPLICATION TO ADVANCED DRIVER ASSISTANCE SYSTEMS . In Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-8425-95-9, pages 334-339. DOI: 10.5220/0003743303340339


in Bibtex Style

@conference{icaart12,
author={Christoph Endres and Christian Müller},
title={A GRAPH-SEARCH APPROACH ON RESOURCE-CONSTRAINED SCHEDULING PROBLEMS AND ITS APPLICATION TO ADVANCED DRIVER ASSISTANCE SYSTEMS},
booktitle={Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2012},
pages={334-339},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003743303340339},
isbn={978-989-8425-95-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - A GRAPH-SEARCH APPROACH ON RESOURCE-CONSTRAINED SCHEDULING PROBLEMS AND ITS APPLICATION TO ADVANCED DRIVER ASSISTANCE SYSTEMS
SN - 978-989-8425-95-9
AU - Endres C.
AU - Müller C.
PY - 2012
SP - 334
EP - 339
DO - 10.5220/0003743303340339