Optimising Flexibility for Simple Temporal Networks

Cees Witteveen

2016

Abstract

We generalise a recently proposed concurrent flexibility metric to overcome some of its shortcomings. We show that these shortcomings can be removed if one selects an optimal subset of variables for which the concurrent flexibility is determined. The flexibility of the remaining variables does not play a role in the determination of the flexibility of the system. We present a preliminary experimental evaluation of the improvement in concurrent flexibility that can be obtained by comparing some (approximation) algorithms. Their performance on several benchmark sets is evaluated. As a result, in some cases the concurrent flexibility of an STN can be enhanced by 20 - 50%.

References

  1. Dechter, R. (2003). Constraint Processing. Morgan Kaufmann.
  2. Floyd, R. (1962). Algorithm 97: Shortest path. Communications of the ACM, 5(6).
  3. Hunsberger, L. (2002). Algorithms for a temporal decoupling problem in multi-agent planning. In Proceedings AAAI.
  4. Jonker, R. and Volgenant, A. (1987). A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing, 38(4):325-340.
  5. Khachiyan, L. (2009). Fourier-motzkin elimination method. In Floudas, C. A. and Pardalos, P. M., editors, Encyclopedia of Optimization, pages 1074-1077. Springer US.
  6. Mountakis, S., Klos, T., and Witteveen, C. (2015). Temporal flexibility revisited: Maximizing flexibility by computing bipartite matchings. In Proceedings Twenty-Fifth International Conference on Automated Planning and Scheduling.
  7. Planken, L. R., Boerkoel, J. C., and Wilcox, R. J. (2013). Multiagent STN benchmark instances.
  8. Wilson, M., Klos, T., Witteveen, C., and Huisman, B. (2013). Flexibility and decoupling in the simple temporal problem. In Rossi, F., editor, Proceedings International Joint Conference on Artificial Intelligence (IJCAI), pages 2422 - 2428. AAAI Press, Menlo Park, CA.
  9. Wilson, M., Klos, T., Witteveen, C., and Huisman, B. (2014). Flexibility and decoupling in simple temporal networks. Artificial Intelligence , 214:26-44.
  10. Witteveen, C., Wilson, M., and Klos, T. (2014). Optimal decoupling in linear constraint systems. In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI-14), pages 2381-2387. AAAI Press, Menlo Park, CA.
Download


Paper Citation


in Harvard Style

Witteveen C. (2016). Optimising Flexibility for Simple Temporal Networks . In Proceedings of the 8th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-172-4, pages 524-531. DOI: 10.5220/0005824205240531


in Bibtex Style

@conference{icaart16,
author={Cees Witteveen},
title={Optimising Flexibility for Simple Temporal Networks},
booktitle={Proceedings of the 8th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2016},
pages={524-531},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005824205240531},
isbn={978-989-758-172-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 8th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Optimising Flexibility for Simple Temporal Networks
SN - 978-989-758-172-4
AU - Witteveen C.
PY - 2016
SP - 524
EP - 531
DO - 10.5220/0005824205240531