Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

MCTS Based Dispatch of Autonomous Vehicles under Operational Constraints for Continuous Transportation (2407.16200v1)

Published 23 Jul 2024 in cs.AI

Abstract: Continuous transportation of material in the mining industry is achieved by the dispatch of autonomous haul-trucks with discrete haulage capacities. Recently, Monte Carlo Tree Search (MCTS) was successfully deployed in tackling challenges of long-run optimality, scalability and adaptability in haul-truck dispatch. Typically, operational constraints imposed on the mine site are satisfied by heuristic controllers or human operators independent of the dispatch planning. This article incorporates operational constraint satisfaction into the dispatch planning by utilising the MCTS based dispatch planner Flow-Achieving Scheduling Tree (FAST). Operational constraint violation and satisfaction are modelled as opportunity costs in the combinatorial optimisation problem of dispatch. Explicit cost formulations are avoided by utilising MCTS generator models to derive opportunity costs. Experimental studies with four types of operational constraints demonstrate the success of utilising opportunity costs for constraint satisfaction, and the effectiveness of integrating constraints into dispatch planning.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (14)
  1. A. Hill, T. Albrecht, K.M. Seiler, A.W. Palmer, S.J. Scheding, and G. Callow, “Mining system,” Jun. 10 2021, uS Patent App. 16/764,731.
  2. R. Leung, A.J. Hill, and A. Melkumyan, “Automation and ai technology in surface mining with a brief introduction to open-pit operations in the pilbara,” arXiv preprint arXiv:2301.09771, 2023.
  3. K.M. Seiler, A.W. Palmer, and A.J. Hill, “Flow-achieving online planning and dispatching for continuous transportation with autonomous vehicles,” IEEE Transactions on Automation Science and Engineering, vol. 19, pp. 457–472, 1 2022.
  4. A.M. Afrapoli and H. Askari-Nasab, “A stochastic integrated simulation and mixed integer linear programming optimisation framework for truck dispatching problem in surface mines,” International Journal of Mining and Mineral Engineering, vol. 11, pp. 257–284, 2020.
  5. R.F. Alexandre, F. Campelo, and J.A. Vasconcelos, “Multi-objective evolutionary algorithms for truck dispatch problem in open-pit mining operations,” Learn. Nonlinear Models, vol.17, no.2, pp.53–66, 2019.
  6. C. Zhang, P. Odonkor, S. Zheng, H. Khorasgani, S. Serita, C. Gupta, and H. Wang, “Dynamic dispatching for large-scale heterogeneous fleet via multi-agent deep reinforcement learning,” IEEE International Conference on Big Data, pp. 1436–1441, 12 2020.
  7. J. P. de Carvalho and R. Dimitrakopoulos, “Integrating production planning with truck-dispatching decisions through reinforcement learning while managing uncertainty,” Minerals, vol. 11, 6 2021.
  8. M. Mansouri, B. Lacerda, N. Hawes, and F. Pecora, “Multi-robot planning under uncertain travel times and safety constraints,” in International Joint Conferences on Artificial Intelligence.   , 2019.
  9. K. Leahy, A. Jones, and C.I. Vasile, “Fast decomposition of temporal logic specifications for heterogeneous teams,” IEEE Robotics and Automation Letters, vol. 7, pp. 2297–2304, 4 2022.
  10. C. Paxton, V. Raman, G.D. Hager, and M. Kobilarov, “Combining neural networks and tree search for task and motion planning in challenging environments,” IEEE International Conference on Intelligent Robots and Systems, vol. 2017-September, pp. 6059–6066, 12 2017.
  11. J.J. Aloor, J. Patrikar, P. Kapoor, J. Oh, and S. Scherer, “Follow the rules: Online signal temporal logic tree search for guided imitation learning in stochastic domains,” in 2023 IEEE International Conference on Robotics and Automation.   , 2023, pp. 1320–1326.
  12. L. Kocsis and C. Szepesvári, “Bandit based monte-carlo planning,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4212 LNAI, pp. 282–293, 2006. [Online]. Available: https://link.springer.com/chapter/10.1007/11871842_29
  13. J. M. Buchanan, “Opportunity cost,” in The world of economics.   Springer, 1991, pp. 520–525.
  14. S. Gelly and D. Silver, “Combining online and offline knowledge in uct,” in Proceedings of the 24th international conference on Machine learning, 2007, pp. 273–280.

Summary

We haven't generated a summary for this paper yet.