[robotics-worldwide] [meetings] Call for Papers: 3rd International Workshop on Multi-Agent Path Finding

Hang Ma hangma at usc.edu
Thu Mar 7 10:06:41 PST 2019


3rd International Workshop on Multi-Agent Path Finding

idm-lab.org/wiki/IJCAI19-MAPF/index.php/Main/HomePage

Part of the International Joint Conference on Artificial Intelligence
(IJCAI) 2019
Macao, China
One Day - August 11 or 12, 2019 (TBD)

Multi-Agent Path Finding (MAPF) is the problem of computing collision-free
paths for a team of agents from their current locations to given
destinations in a known environment. Application examples include
autonomous aircraft towing vehicles, automated warehouse systems, office
robots, and game characters in video games. Solving the MAPF problem
optimally is NP-hard for many objectives, such as minimizing the sum of the
travel costs or the makespan, and can even be NP-hard to approximate. Yet,
practical systems must find high-quality collision-free paths for the
agents quickly because shorter paths result in higher throughput or lower
operating costs (since fewer agents are required).

In recent years, many researchers have explored different variants of the
MAPF problem as well as different approaches with different properties.
Also, different applications have been studied in artificial intelligence,
robotics, and theoretical computer science. The purpose of this workshop is
to bring these researchers together to present their research, discuss
future research directions, and cross-fertilize the different communities.
Researchers and practitioners whose research might apply to MAPF or who
might be able to use MAPF techniques in their research are welcome.

All submissions that relate to collision-free path planning or navigation
for multiple agents are welcome, including but not limited to:


   -

   Search-, rule-, reduction-, reactive-, and learning-based MAPF planners
   -

   Combination of MAPF and task allocation/scheduling
   -

   Combination of MAPF and execution monitoring
   -

   Variants and generalizations of the MAPF problem
   -

   Application domains for MAPF planners
   -

   Actual applications of MAPF planners
   -

   Customization of MAPF planners for actual robots (including kinematic
   constraints)
   -

   Standardization of MAPF terminology and benchmarks


Submissions can contain relevant work in all possible stages, including
work that was recently published, is under submission elsewhere, was only
recently finished, or is still ongoing. Authors of papers published or
under submission elsewhere are encouraged to submit these papers or short
versions (including abstracts) of them to the workshop to educate other
researchers about their work, as long as resubmissions are clearly labeled
to avoid copyright violations. Position papers and surveys are also
welcome. Submissions will go through a light review process to ensure a fit
with the topic of the workshop and acceptable quality. Non-archival
workshop notes will be produced containing the material presented at the
workshop.


Important dates

Submission deadline: April 19, 2019

Notification: May 15, 2019

Camera-ready version: May 29, 2019

Workshop: August 11 or 12, 2019 (TBD)

Information for authors

Submission page: https://urldefense.proofpoint.com/v2/url?u=https-3A__easychair.org_conferences_-3Fconf-3Dwomapf19&d=DwIBaQ&c=clK7kQUTWtAVEOVIgvi0NU5BOUHhpN0H8p7CSfnc_gI&r=0w3solp5fswiyWF2RL6rSs8MCeFamFEPafDTOhgTfYI&m=TUWESmIUpQ7bHM_1aKaXJW659aMf0w6Lt7sOJoplFWA&s=_wrlE17piOp-FBmic5bZe2idnpBVf3oZbkjuHYAvgT0&e=

Format: Any format is acceptable.

Page limitation: There is no limit on the number of pages.

Organizing committee

Liron Cohen (lironcoh at usc.edu) - chair

Hang Ma (hangma at usc.edu) - chair

Ariel Felner (felner at bgu.ac.il)

Daniel Harabor (daniel.harabor at monash.edu)

Sven Koenig (skoenig at cs.usc.edu)

Nathan Sturtevant (nathanst at ualberta.ca)

-- 
Regards,
Hang Ma


More information about the robotics-worldwide mailing list