"On Satisfisfiability Modulo Theories in Continuous Multi-Agent Path ..."

Pavel Surynek (2020)

> Home

Details and statistics

DOI: 10.5220/0008980101820193

access: closed

type: Conference or Workshop Paper

metadata version: 2020-04-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icaart/Surynek20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icaart/Surynek20
Pavel Surynek:
On Satisfisfiability Modulo Theories in Continuous Multi-Agent Path Finding: Compilation-based and Search-based Approaches Compared. ICAART (2) 2020: 182-193

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.