Hong's Homepage

Neptune

I am a Physics PhD candidate at the University of Southern California, advised by Dr. Satish Kumar Thittamaranahalli (T. K. Satish Kumar) and Dr. Sven Koenig.

Email: hongx@usc.edu

My CV is available per request.


Research Interests

Weighted Constraint Satisfaction Problem, Belief Propagation, Hybrid Quantum-Classical Algorithms, and other interdisciplinary areas between Computer Science and Physics in general.

Publications

2017

  • Therese Anders, Hong Xu, Cheng Cheng, and T. K. Satish Kumar. Measuring territorial control in civil wars using hidden Markov models: A data informatics-based approach. In Proceedings of the NIPS 2017 Workshop on Machine Learning for the Developing World. 2017. arXiv:1711.06786.
    [abstract▼] [details] [full text] [BibTeX▼]
  • T. K. Satish Kumar, Hong Xu, Zheng Tang, Anoop Kumar, Craig Milo Rogers, and Craig A. Knoblock. A distributed logical filter for connected row convex constraints. In Proceedings of the 29th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), 96–101. 2017. doi:10.1109/ICTAI.2017.00026.
    [abstract▼] [details] [full text] [slides] [BibTeX▼]
  • Hong Xu, Sven Koenig, and T. K. Satish Kumar. A constraint composite graph-based ILP encoding of the Boolean weighted CSP. In Proceedings of the 23rd International Conference on Principles and Practice of Constraint Programming (CP), 630–638. 2017. doi:10.1007/978-3-319-66158-2_40.
    [abstract▼] [details] [full text] [slides] [BibTeX▼]
  • Hong Xu, T. K. Satish Kumar, and Sven Koenig. Min-max message passing and local consistency in constraint networks. In Proceedings of the 30th Australasian Joint Conference on Artificial Intelligence (AI), 340–352. 2017. doi:10.1007/978-3-319-63004-5_27.
    [abstract▼] [details] [full text] [slides] [BibTeX▼]
  • Hong Xu, T. K. Satish Kumar, and Sven Koenig. A linear-time and linear-space algorithm for the minimum vertex cover problem on giant graphs. In Proceedings of the 10th International Symposium on Combinatorial Search (SoCS), 173–174. 2017. URL: http://aaai.org/ocs/index.php/SOCS/SOCS17/paper/viewFile/15789/15080.
    [abstract▼] [details] [full text] [poster] [BibTeX▼]
  • Hong Xu, T. K. Satish Kumar, and Sven Koenig. The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP. In Proceedings of the 14th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming (CPAIOR), 387–402. 2017. doi:10.1007/978-3-319-59776-8_31.
    [abstract▼] [details] [full text] [slides] [BibTeX▼]

2016

  • Hong Xu, T. K. Satish Kumar, Dylan Johnke, Nora Ayanian, and Sven Koenig. SAGL: a new heuristic for multi-robot routing with complex tasks. In Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), 530–535. 2016. doi:10.1109/ICTAI.2016.0087.
    [abstract▼] [details] [full text] [slides] [BibTeX▼]
  • Hang Ma, Sven Koenig, Nora Ayanian, Liron Cohen, Wolfgang Hoenig, T.K. Satish Kumar, Tansel Uras, Hong Xu, Craig Tovey, and Guni Sharon. Overview: generalizations of multi-agent path finding to real-world scenarios. In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI) Workshop on Multi-Agent Path Finding. 2016. URL: https://www.andrew.cmu.edu/user/gswagner/workshop/IJCAI_2016_WOMPF_paper_6.pdf.
    [abstract▼] [details] [full text] [BibTeX▼]
  • Liron Cohen, Tansel Uras, T. K. Satish Kumar, Hong Xu, Nora Ayanian, and Sven Koenig. Improved solvers for bounded-suboptimal multi-agent path finding. In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI), 3067–3074. 2016. URL: http://www.ijcai.org/Abstract/16/435.
    [abstract▼] [details] [full text] [slides] [BibTeX▼]
  • Wolfgang Hönig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Hong Xu, Nora Ayanian, and Sven Koenig. Multi-agent path finding with kinematic contraints. In Proceedings of the 26th International Conference on Automated Planning and Scheduling (ICAPS), 477–485. 2016. Outstanding paper award in the robotics track. URL: http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13183/12711.
    [abstract▼] [details] [full text] [video] [BibTeX▼]
  • Hong Xu, T. K. Satish Kumar, and Sven Koenig. A new solver for the minimum weighted vertex cover problem. In Proceedings of the 13th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming (CPAIOR), 392–405. 2016. doi:10.1007/978-3-319-33954-2_28.
    [abstract▼] [details] [full text] [slides] [BibTeX▼]