Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHang Ma 0001
馬航
Person information
- affiliation: Simon Fraser University, BC, Canada
- affiliation (former): University of Southern California, Los Angeles, CA, USA
- affiliation (2012 - 2014): McGill University, Montreal, QC, Canada
- unicode name: 馬航
Other persons with the same name
- Hang Ma — disambiguation page
- Hang Ma 0002
![[0000-0003-3397-5245]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-3397-5245")
— University of Maryland, College Park, MD, USA (and 1 more) - Hang Ma 0003 — Shenyang University of Technology, Liaoyang, China
- Hang Ma 0004 — Université de Toulouse, France
- Hang Ma 0005 — Shanghai University, Department of Mechanics, College of Sciences, China
- Hang Ma 0006 — Xi'an Jiaotong University, School of Chemical Engineering and Technology, China
- Hang Ma 0007 — Northwestern Polytechnical University, School of Aeronautics, Xi'an, China
- Hang Ma 0008 — Fourth Military Medical University, Faculty of Biomedical Engineering, Xi'an, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c42]Jingtao Tang, Hang Ma:
Large-Scale Multi-Robot Coverage Path Planning via Local Search. AAAI 2024: 17567-17574- [i22]Jingtao Tang, Hang Ma:
Multi-Robot Connected Fermat Spiral Coverage. CoRR abs/2403.13311 (2024) - 2023
- [j9]Baiyu Li, Hang Ma:
Double-Deck Multi-Agent Pickup and Delivery: Multi-Robot Rearrangement in Large-Scale Warehouses. IEEE Robotics Autom. Lett. 8(6): 3701-3708 (2023) - [j8]Qiushi Lin, Hang Ma:
SACHA: Soft Actor-Critic With Heuristic-Based Attention for Partially Observable Multi-Agent Path Finding. IEEE Robotics Autom. Lett. 8(8): 5100-5107 (2023) - [j7]Jingtao Tang, Hang Ma:
Mixed Integer Programming for Time-Optimal Multi-Robot Coverage Path Planning With Efficient Heuristics. IEEE Robotics Autom. Lett. 8(10): 6491-6498 (2023) - [c41]Yi Zheng, Hang Ma, Sven Koenig, Erik Kline, T. K. Satish Kumar:
Priority-Based Search for the Virtual Network Embedding Problem. ICAPS 2023: 472-480 - [i21]Jingtao Tang, Hang Ma:
Mixed Integer Programming for Time-Optimal Multi-Robot Coverage Path Planning with Efficient Heuristics. CoRR abs/2306.17609 (2023) - [i20]Qiushi Lin, Hang Ma:
SACHA: Soft Actor-Critic with Heuristic-Based Attention for Partially Observable Multi-Agent Path Finding. CoRR abs/2307.02691 (2023) - [i19]Jingtao Tang, Hang Ma:
Large-Scale Multi-Robot Coverage Path Planning via Local Search. CoRR abs/2312.10797 (2023) - 2022
- [j6]Hang Ma:
Intelligent Planning for Large-Scale Multi-Agent Systems. AI Mag. 43(4): 376-382 (2022) - [c40]Xinyi Zhong, Jiaoyang Li, Sven Koenig, Hang Ma:
Optimal and Bounded-Suboptimal Multi-Goal Task Assignment and Path Finding. ICRA 2022: 10731-10737 - [c39]Qinghong Xu, Jiaoyang Li, Sven Koenig, Hang Ma:
Multi-Goal Multi-Agent Pickup and Delivery. IROS 2022: 9964-9971 - [i18]Xinyi Zhong, Jiaoyang Li, Sven Koenig, Hang Ma:
Optimal and Bounded-Suboptimal Multi-Goal Task Assignment and Path Finding. CoRR abs/2208.01222 (2022) - [i17]Qinghong Xu, Jiaoyang Li, Sven Koenig, Hang Ma:
Multi-Goal Multi-Agent Pickup and Delivery. CoRR abs/2208.01223 (2022) - 2021
- [j5]Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Hang Ma, Graeme Gange, Sven Koenig:
Pairwise symmetry reasoning for multi-agent path finding search. Artif. Intell. 301: 103574 (2021) - [c38]Hang Ma:
A Competitive Analysis of Online Multi-Agent Path Finding. ICAPS 2021: 234-242 - [c37]Jiaoyang Li, Zhe Chen, Yi Zheng, Shao-Hung Chan, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge. ICAPS 2021: 477-485 - [c36]Ziyuan Ma, Yudong Luo, Hang Ma:
Distributed Heuristic Multi-Agent Path Finding with Communication. ICRA 2021: 8699-8705 - [c35]Jiaoyang Li, Zhe Chen, Yi Zheng, Shao-Hung Chan, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge. SOCS 2021: 179-181 - [c34]Hang Ma:
Extended Abstract: A Competitive Analysis of Online Multi-Agent Path Finding. SOCS 2021: 182-184 - [e1]Hang Ma, Ivan Serina:
Proceedings of the Fourteenth International Symposium on Combinatorial Search, SOCS 2021, Virtual Conference [Jinan, China], July 26-30, 2021. AAAI Press 2021, ISBN 978-1-57735-870-1 [contents] - [i16]Ziyuan Ma, Yudong Luo, Hang Ma:
Distributed Heuristic Multi-Agent Path Finding with Communication. CoRR abs/2106.11365 (2021) - [i15]Hang Ma:
A Competitive Analysis of Online Multi-Agent Path Finding. CoRR abs/2106.11454 (2021) - 2020
- [c33]Ngai Meng Kou, Cheng Peng, Hang Ma, T. K. Satish Kumar, Sven Koenig:
Idle Time Optimization for Target Assignment and Path Finding in Sortation Centers. AAAI 2020: 9925-9932 - [c32]Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding. ICAPS 2020: 193-201 - [c31]Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar, Sven Koenig:
Moving Agents in Formation in Congested Environments. AAMAS 2020: 726-734 - [c30]Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding. SOCS 2020: 129-130 - [c29]Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar, Sven Koenig:
Moving Agents in Formation in Congested Environments. SOCS 2020: 131-132
2010 – 2019
- 2019
- [j4]Sven Koenig, Sanmay Das, Rosemary D. Paradis, John P. Dickerson, Yolanda Gil, Katherine Guo, Benjamin Kuipers, Iolanda Leite, Hang Ma, Nicholas Mattei, Amy McGovern, Larry R. Medsker, Todd W. Neller, Marion Neumann, Plamen Petrov, Michael Rovatsos, David G. Stork:
ACM SIGAI activity report. AI Matters 5(3): 6-11 (2019) - [c28]Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding. AAAI 2019: 6087-6095 - [c27]Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding for Large Agents. AAAI 2019: 7627-7634 - [c26]Hang Ma, Daniel Harabor, Peter J. Stuckey, Jiaoyang Li, Sven Koenig:
Searching with Consistent Prioritization for Multi-Agent Path Finding. AAAI 2019: 7643-7650 - [c25]Hang Ma, Wolfgang Hönig, T. K. Satish Kumar, Nora Ayanian, Sven Koenig:
Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery. AAAI 2019: 7651-7658 - [c24]Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
Disjoint Splitting for Multi-Agent Path Finding with Conflict-Based Search. ICAPS 2019: 279-283 - [c23]Minghua Liu, Hang Ma, Jiaoyang Li, Sven Koenig:
Task and Path Planning for Multi-Agent Pickup and Delivery. AAMAS 2019: 1152-1160 - [c22]Jiangxing Wang, Jiaoyang Li, Hang Ma, Sven Koenig, T. K. Satish Kumar:
A New Constraint Satisfaction Perspective on Multi-Agent Path Finding: Preliminary Results. AAMAS 2019: 2253-2255 - [c21]Jiaoyang Li, Ariel Felner, Eli Boyarski, Hang Ma, Sven Koenig:
Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search. IJCAI 2019: 442-449 - [c20]Roni Stern, Nathan R. Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Roman Barták, Eli Boyarski:
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. SOCS 2019: 151-158 - [c19]Jiaoyang Li, Eli Boyarski, Ariel Felner, Hang Ma, Sven Koenig:
Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search: Preliminary Results. SOCS 2019: 182-183 - [c18]Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding. SOCS 2019: 184-185 - [c17]Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding for Large Agents. SOCS 2019: 186-187 - [c16]Hang Ma, Daniel Harabor, Peter J. Stuckey, Jiaoyang Li, Sven Koenig:
Extended Abstract: Searching with Consistent Prioritization for Multi-Agent Path Finding. SOCS 2019: 188-189 - [c15]Hang Ma, Wolfgang Hönig, T. K. Satish Kumar, Nora Ayanian, Sven Koenig:
Extended Abstract: Lifelong Path Planning with Kinematic Constraintsfor Multi-Agent Pickup and Delivery. SOCS 2019: 190-191 - [i14]Roni Stern, Nathan R. Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Eli Boyarski, Roman Barták:
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. CoRR abs/1906.08291 (2019) - [i13]Ngai Meng Kou, Cheng Peng, Hang Ma, T. K. Satish Kumar, Sven Koenig:
Idle Time Optimization for Target Assignment and Path Finding in Sortation Centers. CoRR abs/1912.00253 (2019) - 2018
- [j3]Sven Koenig, Sanmay Das, Rosemary D. Paradis, John P. Dickerson, Yolanda Gil, Katherine Guo, Benjamin Kuipers, Hang Ma, Nicholas Mattei, Amy McGovern, Larry R. Medsker, Todd W. Neller, Plamen Petrov, Michael Rovatsos, David G. Stork:
ACM SIGAI activity report. AI Matters 4(3): 7-11 (2018) - [c14]Ariel Felner, Jiaoyang Li, Eli Boyarski, Hang Ma, Liron Cohen, T. K. Satish Kumar, Sven Koenig:
Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding. ICAPS 2018: 83-87 - [c13]Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Deadlines: Preliminary Results. AAMAS 2018: 2004-2006 - [c12]Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Deadlines. IJCAI 2018: 417-423 - [c11]Liron Cohen, Matias Greco, Hang Ma, Carlos Hernández, Ariel Felner, T. K. Satish Kumar, Sven Koenig:
Anytime Focal Search with Applications. IJCAI 2018: 1434-1441 - [i12]Hang Ma, Wolfgang Hönig, Liron Cohen, Tansel Uras, Hong Xu, T. K. Satish Kumar, Nora Ayanian, Sven Koenig:
Overview: A Hierarchical Framework for Plan Generation and Execution in Multi-Robot Systems. CoRR abs/1804.00038 (2018) - [i11]Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Deadlines: Preliminary Results. CoRR abs/1805.04961 (2018) - [i10]Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Deadlines. CoRR abs/1806.04216 (2018) - [i9]Hang Ma, Wolfgang Hönig, T. K. Satish Kumar, Nora Ayanian, Sven Koenig:
Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery. CoRR abs/1812.06355 (2018) - [i8]Hang Ma, Daniel Harabor, Peter J. Stuckey, Jiaoyang Li, Sven Koenig:
Searching with Consistent Prioritization for Multi-Agent Path Finding. CoRR abs/1812.06356 (2018) - 2017
- [j2]Hang Ma, Sven Koenig:
AI buzzwords explained: multi-agent path finding (MAPF). AI Matters 3(3): 15-19 (2017) - [j1]Hang Ma, Wolfgang Hönig, Liron Cohen, Tansel Uras, Hong Xu, T. K. Satish Kumar, Nora Ayanian, Sven Koenig:
Overview: A Hierarchical Framework for Plan Generation and Execution in Multirobot Systems. IEEE Intell. Syst. 32(6): 6-12 (2017) - [c10]Hang Ma, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Delay Probabilities. AAAI 2017: 3605-3612 - [c9]Hang Ma, Jingxing Yang, Liron Cohen, T. K. Satish Kumar, Sven Koenig:
Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments. AIIDE 2017: 270-272 - [c8]Hang Ma, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks. AAMAS 2017: 837-845 - [c7]Wolfgang Hönig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Hong Xu, Nora Ayanian, Sven Koenig:
Summary: Multi-Agent Path Finding with Kinematic Constraints. IJCAI 2017: 4869-4873 - [i7]Hang Ma, Sven Koenig, Nora Ayanian, Liron Cohen, Wolfgang Hönig, T. K. Satish Kumar, Tansel Uras, Hong Xu, Craig A. Tovey, Guni Sharon:
Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios. CoRR abs/1702.05515 (2017) - [i6]Wolfgang Hönig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Sven Koenig, Nora Ayanian:
Path Planning with Kinematic Constraints for Robot Groups. CoRR abs/1704.07538 (2017) - [i5]Hang Ma, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks. CoRR abs/1705.10868 (2017) - [i4]Hang Ma, Jingxing Yang, Liron Cohen, T. K. Satish Kumar, Sven Koenig:
Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments. CoRR abs/1710.01447 (2017) - [i3]Hang Ma, Sven Koenig:
AI Buzzwords Explained: Multi-Agent Path Finding (MAPF). CoRR abs/1710.03774 (2017) - 2016
- [c6]Hang Ma, Craig A. Tovey, Guni Sharon, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem. AAAI 2016: 3166-3173 - [c5]Robert Morris, Corina S. Pasareanu, Kasper Søe Luckow, Waqar Malik, Hang Ma, T. K. Satish Kumar, Sven Koenig:
Planning, Scheduling and Monitoring for Airport Surface Operations. AAAI Workshop: Planning for Hybrid Systems 2016 - [c4]Wolfgang Hönig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Hong Xu, Nora Ayanian, Sven Koenig:
Multi-Agent Path Finding with Kinematic Constraints. ICAPS 2016: 477-485 - [c3]Hang Ma, Sven Koenig:
Optimal Target Assignment and Path Finding for Teams of Agents. AAMAS 2016: 1144-1152 - [c2]Wolfgang Hönig, T. K. Satish Kumar, Hang Ma, Sven Koenig, Nora Ayanian:
Formation change for robot groups in occluded environments. IROS 2016: 4836-4842 - [i2]Hang Ma, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Delay Probabilities. CoRR abs/1612.05309 (2016) - [i1]Hang Ma, Sven Koenig:
Optimal Target Assignment and Path Finding for Teams of Agents. CoRR abs/1612.05693 (2016) - 2015
- [c1]Hang Ma, Joelle Pineau:
Information Gathering and Reward Exploitation of Subgoals for POMDPs. AAAI 2015: 3320-3326
Coauthor Index
[c41] [c40] [c39] [i18] [i17] [j5] [c37] [c35] [c33] [c32] [c31] [c30] [c29] [j4] [c28] [c27] [c26] [c25] [c24] [c23] [c22] [c21] [c20] [c19] [c18] [c17] [c16] [c15] [i14] [i13] [j3] [c14] [c13] [c12] [c11] [i12] [i11] [i10] [i9] [i8] [j2] [j1] [c10] [c9] [c8] [c7] [i7] [i6] [i5] [i4] [i3] [c6] [c5] [c4] [c3] [c2] [i2] [i1]
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-11 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
