On the public citation graph
Incremental multi-agent path finding
0 signed · 44 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0004-3702(96)00007-0openalex-snapshot
Artificial intelligence: A modern approach
inferredcites →https://doi.org/10.1016/j.artint.2012.11.006openalex-snapshot
The increasing cost tree search for optimal multi-agent pathfinding
inferredcites →https://doi.org/10.1016/j.artint.2014.11.001openalex-snapshot
Subdimensional expansion for multirobot path planning
inferredcites →https://doi.org/10.1016/j.artint.2014.11.006openalex-snapshot
Conflict-based search for optimal multi-agent pathfinding
inferredcites →https://doi.org/10.1016/j.future.2013.12.018openalex-snapshot
Modeling and simulation for natural disaster contingency planning driven by high-resolution remote sensing images
inferredcites →https://doi.org/10.1016/j.future.2019.01.043openalex-snapshot
New and improved search algorithms and precise analysis of their average-case complexity
inferredcites →https://doi.org/10.1016/j.future.2019.09.030openalex-snapshot
3D multi-UAV cooperative velocity-aware motion planning
inferredcites →https://doi.org/10.1109/iccad.1990openalex-snapshot
1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers
inferredcites →https://doi.org/10.1109/iccad.1990.129849openalex-snapshot
Algorithms for discrete function manipulation
inferredcites →https://doi.org/10.1109/tciaig.2012.2197681openalex-snapshot
Benchmarks for Grid-Based Pathfinding
inferredcites →https://doi.org/10.1109/tits.2013.2269713openalex-snapshot
BeeJamA: A Distributed, Self-Adaptive Vehicle Routing Guidance Approach
inferredcites →https://doi.org/10.1109/tits.2016.2531425openalex-snapshot
Next Road Rerouting: A Multiagent System for Mitigating Unexpected Urban Traffic Congestion
inferredcites →https://doi.org/10.1109/tssc.1968.300136openalex-snapshot
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
inferredcites →https://doi.org/10.1145/1160633.1160735openalex-snapshot
Distributed navigation in an unknown physical environment
inferredcites →https://doi.org/10.1609/aaai.v24i1.7564openalex-snapshot
Finding Optimal Solutions to Cooperative Pathfinding Problems
inferredcites →https://doi.org/10.1609/aaai.v30i1.10409openalex-snapshot
Multi-Agent Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem
inferredcites →https://doi.org/10.1609/icaps.v26i1.13796openalex-snapshot
Multi-Agent Path Finding with Kinematic Constraints
inferredcites →https://doi.org/10.48550/arxiv.1702.05515openalex-snapshot
Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios
inferredcites →https://doi.org/10.5555/2936924.2937092openalex-snapshot
Optimal Target Assignment and Path Finding for Teams of Agents
inferredcites →https://doi.org/10.5555/3091125.3091243openalex-snapshot
Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks
inferredcites →https://doi.org/10.5772/57313openalex-snapshot
A Survey and Analysis of Multi-Robot Coordination
inferredcites →https://doi.org/10.5860/choice.33-1577openalex-snapshot
Artificial intelligence: a modern approach
inferredcites →https://doi.org/10.65109/qtkr1570openalex-snapshot
Task and Path Planning for Multi-Agent Pickup and Delivery
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-63223-5_26openalex-snapshot
Incremental Conflict-Based Search for Multi-agent Path Finding in Dynamic Environment
inferred← citeshttps://doi.org/10.1007/978-3-032-25032-2_16openalex-snapshot
Dynamic and Partially Observable MAPF: An Extended Evaluation Integrating Informed Path Reuse and Context-Aware Planning
inferred← citeshttps://doi.org/10.1016/j.aei.2023.102026openalex-snapshot
Solving an industry-inspired generalization of lifelong MAPF problem including multiple delivery locations
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2022.108473openalex-snapshot
Conflict-based search with D* lite algorithm for robot path planning in unknown dynamic environments
inferred← citeshttps://doi.org/10.1016/j.engappai.2025.112078openalex-snapshot
Collaborative energy-saving path planning of unmanned surface vehicle cluster based on multi-head attention mechanism and multi-agent deep reinforcement learning
inferred← citeshttps://doi.org/10.1016/j.tre.2026.105008openalex-snapshot
Task-driven dynamic lane-level path planning for intelligent transfer vehicles in container terminals
inferred← citeshttps://doi.org/10.1109/access.2023.3249757openalex-snapshot
Multi-Agent Action Graph Based Task Allocation and Path Planning Considering Changes in Environment
inferred← citeshttps://doi.org/10.1109/asma67812.2025.11553070openalex-snapshot
DCPO: A Model for Dynamic Collaborative Path Planning with Learnable Credit Assignment
inferred← citeshttps://doi.org/10.1109/iccar55106.2022.9782594openalex-snapshot
Collision Cone Based Collision Avoidance for Hexa-Rotors
inferred← citeshttps://doi.org/10.1109/iros60139.2025.11246671openalex-snapshot
Cooperative Multi-Robot Path Finding with Removable Obstacles for Autonomous Environment Modification
inferred← citeshttps://doi.org/10.1109/jiot.2025.3587737openalex-snapshot
4WIDS-MAPF: Multiagent Pathfinding for Four-Wheel Independent Drive/Steering Robots
inferred← citeshttps://doi.org/10.1109/lra.2025.3554099openalex-snapshot
A Robust Lifelong Multi-Agent Path Finding With Active Conflict Resolution and Decentralized Execution
inferred← citeshttps://doi.org/10.2139/ssrn.6827441openalex-snapshot
Alarm pheromone-guided robust lifelong multi-agent path finding with delays
inferred← citeshttps://doi.org/10.3390/drones7030217openalex-snapshot
Multi-Conflict-Based Optimal Algorithm for Multi-UAV Cooperative Path Planning
inferred← citeshttps://doi.org/10.3390/drones8060274openalex-snapshot
Research on Multi-UAV Cooperative Dynamic Path Planning Algorithm Based on Conflict Search
inferred← citeshttps://doi.org/10.3390/drones8070307openalex-snapshot
Optimizing Drone Logistics: A Scoring Algorithm for Enhanced Decision Making across Diverse Domains in Drone Airlines
inferred← citeshttps://doi.org/10.3390/drones9120850openalex-snapshot
WA-LPA*: An Energy-Aware Path-Planning Algorithm for UAVs in Dynamic Wind Environments
inferred← citeshttps://doi.org/10.3390/s23073512openalex-snapshot
PRM-D* Method for Mobile Robot Path Planning
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.