◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

S. Ardizzoni

10 papers hereh-index 548 citations20 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author8
  • middle author2

Across the 10 of 10 papers where every author was matched, so the position is known.

fields
  • cs.MA4
  • math.OC4
  • cs.DS1
  • eess.SY1

identity via Semantic Scholar / OpenAlex

activity
20212025
most citedMulti-Agent Path Finding on Strongly Connected Digraphs: feasibility and solution algorithms

9 citations · 28 across the 10 of their papers we have counts for

collaborators
Showing 2022Show all

2 papers · 1 filter

cs.MA2022★ 3 cited

Constrained Multi-Agent Path Finding on Directed Graphs

Stefano Ardizzoni, Luca Consolini, Marco Locatelli +1

We discuss C-MP and C-MAPF, generalizations of the classical Motion Planning (MP) and Multi-Agent Path Finding (MAPF) problems on a directed graph G. Namely, we enforce an upper bo…

cs.MA2022★ 9 cited

Multi-Agent Path Finding on Strongly Connected Digraphs: feasibility and solution algorithms

Stefano Ardizzoni, Irene Saccani, Luca Consolini +1

On an assigned graph, the problem of Multi-Agent Pathfinding (MAPF) consists in finding paths for multiple agents, avoiding collisions. Finding the minimum-length solution is known…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.