{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T06:40:13Z","timestamp":1735627213179,"version":"3.32.0"},"reference-count":13,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2024,8]]},"abstract":"<jats:p>Spatiotemporal applications such as taxi order dispatching and warehouse task scheduling depend critically on the algorithms for operational efficiency. However, the inherent dynamic nature of these applications presents challenges in algorithm design. The growth of mobility services has facilitated the collection of extensive spatiotemporal data, which in turn prompted algorithm designers to use data-driven methods. Reinforcement learning (RL), recognized for its strong performance and suitability for spatiotemporal contexts, has garnered considerable research interest. Despite their potential, RL algorithms necessitate the use of a simulator for both training and validation purposes. However, no specific simulation system has been developed for spatiotemporal algorithm design. This vacancy hinders the progress of spatiotemporal algorithm designers. In this demo, we build a system called Data-driven Spatiotemporal Simulator (DSS), hoping to bring convenience for spatiotemporal algorithm designers. DSS is adept at handling problems related to taxi order dispatching and warehouse task scheduling and possesses the versatility to be expanded for other user-defined scenarios. The system includes visualization modules that offer insightful panels, alongside developer tools designed to streamline the development process. This enables designers to efficiently craft, evaluate, and refine their algorithms, potentially accelerating innovation in spatiotemporal application development.<\/jats:p>","DOI":"10.14778\/3685800.3685849","type":"journal-article","created":{"date-parts":[[2024,11,8]],"date-time":"2024-11-08T17:25:21Z","timestamp":1731086721000},"page":"4257-4260","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Data-Driven Spatiotemporal Simulator for Reinforcement Learning Methods"],"prefix":"10.14778","volume":"17","author":[{"given":"Dingyuan","family":"Shi","sequence":"first","affiliation":[{"name":"Beijing Advanced Innovation Center for Future Blockchain and Privacy Computing, Beihang University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bingchen","family":"Song","sequence":"additional","affiliation":[{"name":"Beijing Institute of Astronautical Systems Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanyuan","family":"Zhang","sequence":"additional","affiliation":[{"name":"North China Institute of Computing Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haolong","family":"Yang","sequence":"additional","affiliation":[{"name":"Beihang University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Xu","sequence":"additional","affiliation":[{"name":"Beihang University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,11,8]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"The Hungarian method for the assignment problem. Naval research logistics quarterly 2, 1--2","author":"Kuhn Harold W","year":"1955","unstructured":"Harold W Kuhn. 1955. The Hungarian method for the assignment problem. Naval research logistics quarterly 2, 1--2 (1955), 83--97."},{"unstructured":"Timothy P. Lillicrap Jonathan J. Hunt Alexander Pritzel Nicolas Heess Tom Erez Yuval Tassa David Silver and Daan Wierstra. 2016. Continuous control with deep reinforcement learning. In ICLR.","key":"e_1_2_1_2_1"},{"key":"e_1_2_1_3_1","volume-title":"Riedmiller","author":"Mnih Volodymyr","year":"2013","unstructured":"Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Alex Graves, Ioannis Antonoglou, Daan Wierstra, and Martin A. Riedmiller. 2013. Playing Atari with Deep Reinforcement Learning. CoRR abs\/1312.5602 (2013)."},{"doi-asserted-by":"publisher","key":"e_1_2_1_4_1","DOI":"10.1016\/j.trc.2022.103852"},{"unstructured":"Tom Schaul John Quan Ioannis Antonoglou and David Silver. 2016. Prioritized Experience Replay. In ICLR.","key":"e_1_2_1_5_1"},{"key":"e_1_2_1_6_1","volume-title":"Proximal Policy Optimization Algorithms. CoRR abs\/1707.06347","author":"Schulman John","year":"2017","unstructured":"John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. 2017. Proximal Policy Optimization Algorithms. CoRR abs\/1707.06347 (2017)."},{"unstructured":"Dingyuan Shi Yongxin Tong Zimu Zhou Bingchen Song Weifeng Lv and Qiang Yang. 2021. Learning to Assign: Towards Fair Task Assignment in Large-Scale Ride Hailing. In KDD. ACM 3549--3557.","key":"e_1_2_1_7_1"},{"volume-title":"Adaptive Task Planning for Large-Scale Robotized Warehouses","author":"Shi Dingyuan","unstructured":"Dingyuan Shi, Yongxin Tong, Zimu Zhou, Ke Xu, Wenzhe Tan, and Hongbo Li. 2022. Adaptive Task Planning for Large-Scale Robotized Warehouses. In ICDE. IEEE, 3327--3339.","key":"e_1_2_1_8_1"},{"unstructured":"Dingyuan Shi Yongxin Tong Zimu Zhou Ke Xu Zheng Wang and Jieping Ye. 2024. Graph-Constrained Diffusion for End-to-end Path Planning. In ICLR.","key":"e_1_2_1_9_1"},{"volume-title":"Collision-Aware Route Planning in Warehouses Made Efficient: A Strip-based Framework","author":"Shi Dingyuan","unstructured":"Dingyuan Shi, Nan Zhou, Yongxin Tong, Zimu Zhou, Yi Xu, and Ke Xu. 2023. Collision-Aware Route Planning in Warehouses Made Efficient: A Strip-based Framework. In ICDE. IEEE, 869--881.","key":"e_1_2_1_10_1"},{"doi-asserted-by":"crossref","unstructured":"Xiaocheng Tang Fan Zhang Zhiwei (Tony) Qin Yansheng Wang Dingyuan Shi Bingchen Song Yongxin Tong Hongtu Zhu and Jieping Ye. 2021. Value Function is All You Need: A Unified Learning Framework for Ride Hailing Platforms. In KDD. ACM 3605--3615.","key":"e_1_2_1_11_1","DOI":"10.1145\/3447548.3467096"},{"doi-asserted-by":"publisher","key":"e_1_2_1_12_1","DOI":"10.1109\/TKDE.2021.3127077"},{"doi-asserted-by":"publisher","key":"e_1_2_1_13_1","DOI":"10.1007\/BF00992696"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3685800.3685849","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T05:29:51Z","timestamp":1735622991000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3685800.3685849"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8]]},"references-count":13,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["10.14778\/3685800.3685849"],"URL":"https:\/\/doi.org\/10.14778\/3685800.3685849","relation":{},"ISSN":["2150-8097"],"issn-type":[{"type":"print","value":"2150-8097"}],"subject":[],"published":{"date-parts":[[2024,8]]},"assertion":[{"value":"2024-11-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}