About Me

I am a Ph.D. candidate in the AIRob Lab at Simon Fraser University, advised by Professor Hang Ma. I develop structure-exploiting AI planning methods, combining heuristic search, combinatorial optimization, and Graphs of Convex Sets (GCS). My work applies these methods to multi-robot systems and automated engineering design. I am also interested in automated planning applications in transportation, manufacturing, and construction. My earlier research at the Shenzhen Institute of Artificial Intelligence and Robotics for Society and East China Normal University was advised by Professors Tin Lun Lam and Xinyu Zhang.

Research

	📌 Search-Based Spatiotemporal and Multi-Robot Motion Planning on Graphs of Space-Time Convex Sets \| 🌐 Homepage \| ArXiv \| Code 👥 Jingtao Tang, Zining Mao, Lufan Yang, Hang Ma 💡 TL;DR: Fast continuous-space planning for robots moving through dynamic, crowded environments using search on space-time convex regions.
	📌 GHOST: Solving the Traveling Salesman Problem on Graphs of Convex Sets \| 🌐 Homepage \| ArXiv \| Code 👥 Jingtao Tang, Hang Ma 📢 AAAI-26 💡 TL;DR: An optimal hierarchical framework for the Traveling Salesman Problem on Graphs of Convex Sets.
	📌 Space-Time Graphs of Convex Sets for Multi-Robot Motion Planning \| 🌐 Homepage \| ArXiv \| Code 👥 Jingtao Tang, Zining Mao, Lufan Yang, Hang Ma 📢 IROS-25 \| RSS-25 Workshop on MRS (Best Paper Award) 💡 TL;DR: A time-optimal deterministic spatiotemporal planner for multi-robot motion planning.
	📌 Large-Scale Multirobot Coverage Path Planning on Grids with Path Deconfliction \| 🌐 Homepage \| ArXiv \| Code 👥 Jingtao Tang, Zining Mao, Hang Ma 📢 AAAI-24 \| IEEE Transactions on Robotics (T-RO), vol. 41, pp. 3348-3367, 2025 💡 TL;DR: An algorithmic pipeline to plan conflict-free coverage paths for multiple robots on grids.
	📌 Multi-Robot Connected Fermat Spiral Coverage \| ArXiv \| Code 👥 Jingtao Tang, Hang Ma 📢 ICAPS-24 💡 TL;DR: A decomposition-free multi-robot coverage path planning algorithm that generates smooth and continuous trajecories for arbitrarily-shaped workspaces.
	📌 Mixed Integer Programming for Time-Optimal Multi-Robot Coverage Path Planning With Efficient Heuristics \| 🌐 Homepage \| ArXiv \| Code 👥 Jingtao Tang, Hang Ma 📢 IEEE Robotics and Automation Letters (RA-L) 8.10 (2023): 6491-6498. 💡 TL;DR: A mixed-integer program for min-max tree cover problem and grid-based multi-robot coverage path planning.
	📌 Learning to Coordinate for a Worker-Station Multi-robot System in Planar Coverage Tasks \| 🌐 Homepage \| ArXiv 👥 Jingtao Tang, Yuan Gao, Tin Lun Lam 📢 IEEE Robotics and Automation Letters (RA-L) 7.4 (2022): 12315-12322. 💡 TL;DR: A DRL-based decentralized planning for collaborative coverage task of a heteogeneous multi-robot system.
	📌 MSTC: Multi-robot Coverage Path Planning under Physical Constrain \| 🌐 Homepage \| ArXiv \| Code 👥 Jingtao Tang, Chun Sun, Xinyu Zhang 📢 ICRA-21 💡 TL;DR*: planning problems from an ambitious project: robot swarms for large-scale ecological restoration task.
	📌 Hybrid Projection for Encoding 360 VR Videos \| 🌐 Homepage \| Paper 👥 Jingtao Tang, Xinyu Zhang 📢 IEEE-VR-19 💡 TL;DR: A hybrid projection format for efficient encoding/decoding panarama VR videos.

	📌 Search-Based Spatiotemporal and Multi-Robot Motion Planning on Graphs of Space-Time Convex Sets \| 🌐 Homepage \| ArXiv \| Code 👥 Jingtao Tang, Zining Mao, Lufan Yang, Hang Ma 💡 TL;DR: Fast continuous-space planning for robots moving through dynamic, crowded environments using search on space-time convex regions.
	📌 GHOST: Solving the Traveling Salesman Problem on Graphs of Convex Sets \| 🌐 Homepage \| ArXiv \| Code 👥 Jingtao Tang, Hang Ma 📢 AAAI-26 💡 TL;DR: An optimal hierarchical framework for the Traveling Salesman Problem on Graphs of Convex Sets.
	📌 Space-Time Graphs of Convex Sets for Multi-Robot Motion Planning \| 🌐 Homepage \| ArXiv \| Code 👥 Jingtao Tang, Zining Mao, Lufan Yang, Hang Ma 📢 IROS-25 \| RSS-25 Workshop on MRS (Best Paper Award) 💡 TL;DR: A time-optimal deterministic spatiotemporal planner for multi-robot motion planning.
	📌 Large-Scale Multirobot Coverage Path Planning on Grids with Path Deconfliction \| 🌐 Homepage \| ArXiv \| Code 👥 Jingtao Tang, Zining Mao, Hang Ma 📢 AAAI-24 \| IEEE Transactions on Robotics (T-RO), vol. 41, pp. 3348-3367, 2025 💡 TL;DR: An algorithmic pipeline to plan conflict-free coverage paths for multiple robots on grids.
	📌 Multi-Robot Connected Fermat Spiral Coverage \| ArXiv \| Code 👥 Jingtao Tang, Hang Ma 📢 ICAPS-24 💡 TL;DR: A decomposition-free multi-robot coverage path planning algorithm that generates smooth and continuous trajecories for arbitrarily-shaped workspaces.
	📌 Mixed Integer Programming for Time-Optimal Multi-Robot Coverage Path Planning With Efficient Heuristics \| 🌐 Homepage \| ArXiv \| Code 👥 Jingtao Tang, Hang Ma 📢 IEEE Robotics and Automation Letters (RA-L) 8.10 (2023): 6491-6498. 💡 TL;DR: A mixed-integer program for min-max tree cover problem and grid-based multi-robot coverage path planning.
	📌 Learning to Coordinate for a Worker-Station Multi-robot System in Planar Coverage Tasks \| 🌐 Homepage \| ArXiv 👥 Jingtao Tang, Yuan Gao, Tin Lun Lam 📢 IEEE Robotics and Automation Letters (RA-L) 7.4 (2022): 12315-12322. 💡 TL;DR: A DRL-based decentralized planning for collaborative coverage task of a heteogeneous multi-robot system.
	📌 MSTC: Multi-robot Coverage Path Planning under Physical Constrain \| 🌐 Homepage \| ArXiv \| Code 👥 Jingtao Tang, Chun Sun, Xinyu Zhang 📢 ICRA-21 💡 TL;DR*: planning problems from an ambitious project: robot swarms for large-scale ecological restoration task.
	📌 Hybrid Projection for Encoding 360 VR Videos \| 🌐 Homepage \| Paper 👥 Jingtao Tang, Xinyu Zhang 📢 IEEE-VR-19 💡 TL;DR: A hybrid projection format for efficient encoding/decoding panarama VR videos.

Jingtao Tang (汤景韬)

Education

Research Interests

Academic Service

Talks

About Me

Research