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, and other interdisciplinary areas between Computer Science and Physics in general.

Publications

2017

  • Hong Xu, T. K. Satish Kumar, and Sven Koenig. The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP. In the 14th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming (CPAIOR). 2017.
    [abstract▼] [details] [full text] [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 IEEE 28th 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 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 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 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 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▼]