default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefano Ardizzoni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j4]Stefano Ardizzoni, Luca Consolini, Marco Locatelli, Irene Saccani:
Constrained Motion Planning and Multi-Agent Path Finding on directed graphs. Autom. 165: 111593 (2024)- [j3]Stefano Ardizzoni, Irene Saccani, Luca Consolini, Marco Locatelli, Bernhard Nebel:
An Algorithm with Improved Complexity for Pebble Motion/Multi-Agent Path Finding on Trees. J. Artif. Intell. Res. 79: 483-514 (2024) - 2023
- [j2]Stefano Ardizzoni
, Luca Consolini, Mattia Laurini, Marco Locatelli:
Solution Algorithms for the Bounded Acceleration Shortest Path Problem. IEEE Trans. Autom. Control. 68(3): 1910-1917 (2023) - 2022
- [j1]Stefano Ardizzoni, Luca Consolini, Mattia Laurini, Marco Locatelli:
Shortest path with acceleration constraints: complexity and approximation algorithms. Comput. Optim. Appl. 83(2): 555-592 (2022)
Conference and Workshop Papers
- 2023
- [c3]Stefano Ardizzoni, Irene Saccani, Luca Consolini, Marco Locatelli:
Local Optimization of MAPF Solutions on Directed Graphs. CDC 2023: 8081-8086 - 2022
- [c2]Stefano Ardizzoni, Irene Saccani, Luca Consolini, Marco Locatelli:
Multi-Agent Path Finding on Strongly Connected Digraphs. CDC 2022: 7194-7199 - 2021
- [c1]Stefano Ardizzoni, Luca Consolini, Mattia Laurini, Marco Locatelli:
Efficient solution algorithms for the Bounded Acceleration Shortest Path problem. CDC 2021: 5729-5734
Informal and Other Publications
- 2024
- [i6]Mattia Laurini, Irene Saccani, Stefano Ardizzoni, Luca Consolini, Marco Locatelli:
A Dynamic Programming Approach for Road Traffic Estimation. CoRR abs/2403.18561 (2024) - [i5]Irene Saccani, Stefano Ardizzoni, Luca Consolini, Marco Locatelli:
Dynamic Programming based Local Search approaches for Multi-Agent Path Finding problems on Directed Graphs. CoRR abs/2410.07954 (2024) - 2023
- [i4]Stefano Ardizzoni, Irene Saccani, Luca Consolini, Marco Locatelli, Bernhard Nebel:
An algorithm with improved complexity for pebble motion/multi-agent path finding on trees. CoRR abs/2307.12770 (2023) - 2022
- [i3]Stefano Ardizzoni, Irene Saccani, Luca Consolini, Marco Locatelli:
Multi-Agent Path Finding on Strongly Connected Digraphs: feasibility and solution algorithms. CoRR abs/2209.04286 (2022) - [i2]Stefano Ardizzoni, Luca Consolini, Marco Locatelli, Irene Saccani:
Constrained Multi-Agent Path Finding on Directed Graphs. CoRR abs/2209.12506 (2022) - 2021
- [i1]Stefano Ardizzoni, Luca Consolini, Mattia Laurini, Marco Locatelli:
The Bounded Acceleration Shortest Path problem: complexity and solution algorithms. CoRR abs/2103.02914 (2021)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
