Migrating Techniques from Search-based Multi-Agent Path Finding Solvers to SAT-based Approach (Q5076310): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1613/jair.1.13318 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4211174927 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:12, 19 March 2024
scientific article; zbMATH DE number 7527534
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Migrating Techniques from Search-based Multi-Agent Path Finding Solvers to SAT-based Approach |
scientific article; zbMATH DE number 7527534 |
Statements
Migrating Techniques from Search-based Multi-Agent Path Finding Solvers to SAT-based Approach (English)
0 references
16 May 2022
0 references
problem solving
0 references
satisfiability
0 references
constraint satisfaction
0 references
planning
0 references
