On the public citation graph
Alarm pheromone-guided robust lifelong multi-agent path finding with delays
0 signed · 47 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.1007/s10514-019-09869-wopenalex-snapshot
Hybrid planning and distributed iterative repair for multi-robot missions with communication losses
inferredcites →https://doi.org/10.1007/s43154-023-00104-0openalex-snapshot
Formal Modelling for Multi-Robot Systems Under Uncertainty
inferredcites →https://doi.org/10.1016/j.aei.2023.102026openalex-snapshot
Solving an industry-inspired generalization of lifelong MAPF problem including multiple delivery locations
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.006openalex-snapshot
Conflict-based search for optimal multi-agent pathfinding
inferredcites →https://doi.org/10.1016/j.artint.2022.103662openalex-snapshot
Multi-Agent Pathfinding with Continuous Time
inferredcites →https://doi.org/10.1016/j.artint.2022.103752openalex-snapshot
Priority inheritance with backtracking for iterative multi-agent path finding
inferredcites →https://doi.org/10.1016/j.artint.2022.103766openalex-snapshot
Multi-agent path finding with mutex propagation
inferredcites →https://doi.org/10.1016/j.eswa.2025.130615openalex-snapshot
Integrated task assignment and path planning for Collision-Minimizing multiple Automated guided vehicles scheduling
inferredcites →https://doi.org/10.1016/j.future.2020.09.032openalex-snapshot
Incremental multi-agent path finding
inferredcites →https://doi.org/10.1016/j.ibmb.2020.103514openalex-snapshot
Insect alarm pheromones in response to predators: Ecological trade-offs and molecular mechanisms
inferredcites →https://doi.org/10.1016/j.robot.2020.103629openalex-snapshot
Battery charge scheduling in long-life autonomous mobile robots via multi-objective decision making under uncertainty
inferredcites →https://doi.org/10.1109/ccta53793.2025.11151327openalex-snapshot
Robust Space-Time A* for Human-In-The-Loop Multi-Agent Pickup and Delivery
inferredcites →https://doi.org/10.1109/icra.2011.5980306openalex-snapshot
SIPP: Safe interval path planning for dynamic environments
inferredcites →https://doi.org/10.1109/lra.2019.2894217openalex-snapshot
Persistent and Robust Execution of MAPF Schedules in Warehouses
inferredcites →https://doi.org/10.1109/lra.2020.2967317openalex-snapshot
Walk, Stop, Count, and Swap: Decentralized Multi-Agent Path Finding With Theoretical Guarantees
inferredcites →https://doi.org/10.1109/lra.2024.3392084openalex-snapshot
Adaptive Lifelong Multi-Agent Path Finding With Multiple Priorities
inferredcites →https://doi.org/10.1109/lra.2025.3554099openalex-snapshot
A Robust Lifelong Multi-Agent Path Finding With Active Conflict Resolution and Decentralized Execution
inferredcites →https://doi.org/10.1109/lra.2025.3597871openalex-snapshot
Congestion Mitigation Path Planning for Large-Scale Multi-Agent Navigation in Dense Environments
inferredcites →https://doi.org/10.1109/lra.2025.3616648openalex-snapshot
Lifelong Multi-Agent Path Finding Based on Reinforcement Learning and GPU
inferredcites →https://doi.org/10.1109/tase.2015.2445780openalex-snapshot
Prioritized Planning Algorithms for Trajectory Coordination of Multiple Mobile Robots
inferredcites →https://doi.org/10.1109/tase.2022.3183183openalex-snapshot
A Conflict-Based Search Framework for Multiobjective Multiagent Path Finding
inferredcites →https://doi.org/10.1109/tiv.2024.3355423openalex-snapshot
A Priority-Based Hierarchical Framework for k-Robust Multi-Agent Path Finding
inferredcites →https://doi.org/10.1109/tro.2016.2593448openalex-snapshot
Optimal Multirobot Path Planning on Graphs: Complete Algorithms and Effective Heuristics
inferredcites →https://doi.org/10.1109/tro.2023.3258690openalex-snapshot
Offline Time-Independent Multiagent Path Planning
inferredcites →https://doi.org/10.1109/tro.2023.3344051openalex-snapshot
Receding Horizon Re-Ordering of Multi-Agent Execution Schedules
inferredcites →https://doi.org/10.1609/aaai.v27i1.8541openalex-snapshot
Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs
inferredcites →https://doi.org/10.1609/aaai.v33i01.33017643openalex-snapshot
Searching with Consistent Prioritization for Multi-Agent Path Finding
inferredcites →https://doi.org/10.1609/aaai.v35i13.17344openalex-snapshot
Lifelong Multi-Agent Path Finding in Large-Scale Warehouses
inferredcites →https://doi.org/10.1609/aaai.v35i14.17466openalex-snapshot
EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding
inferredcites →https://doi.org/10.1609/aaai.v36i9.21266openalex-snapshot
MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search
inferredcites →https://doi.org/10.1609/aaai.v38i18.30054openalex-snapshot
Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding
inferredcites →https://doi.org/10.1609/aaai.v39i14.33614openalex-snapshot
Online Guidance Graph Optimization for Lifelong Multi-Agent Path Finding
inferredcites →https://doi.org/10.1609/aaai.v39i22.34506openalex-snapshot
Concurrent Planning and Execution in Lifelong Multi-Agent Path Finding with Delay Probabilities
inferredcites →https://doi.org/10.1609/icaps.v26i1.13796openalex-snapshot
Multi-Agent Path Finding with Kinematic Constraints
inferredcites →https://doi.org/10.1609/icaps.v27i1.13866openalex-snapshot
Path Planning for Multiple Agents under Uncertainty
inferredcites →https://doi.org/10.1609/icaps.v30i1.6642openalex-snapshot
Probabilistic Robust Multi-Agent Path Finding
inferredcites →https://doi.org/10.1609/socs.v15i1.21759openalex-snapshot
Leveraging Experience in Lifelong Multi-Agent Pathfinding
inferredcites →https://doi.org/10.1609/socs.v16i1.27282openalex-snapshot
Adapting to Planning Failures in Lifelong Multi-Agent Path Finding
inferredcites →https://doi.org/10.1609/socs.v17i1.31540openalex-snapshot
Introducing Delays in Multi Agent Path Finding
inferredcites →https://doi.org/10.1609/socs.v17i1.31565openalex-snapshot
Scaling Lifelong Multi-Agent Path Finding to More Realistic Settings: Research Challenges and Opportunities
inferredcites →https://doi.org/10.1613/jair.1.11734openalex-snapshot
Robust Multi-Agent Path Finding and Executing
inferredcites →https://doi.org/10.1613/jair.1.12397openalex-snapshot
Safe Multi-Agent Pathfinding with Time Uncertainty
inferredcites →https://doi.org/10.65109/qtkr1570openalex-snapshot
Task and Path Planning for Multi-Agent Pickup and Delivery
inferredcites →https://doi.org/10.65109/tdcl3295openalex-snapshot
Enhancing Lifelong Multi-Agent Path-finding by Using Artificial Potential Fields
inferredcites →https://doi.org/10.65109/tnmo6004openalex-snapshot
Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks
inferredcites →https://doi.org/10.65109/uvds9134openalex-snapshot
Online Re-Planning and Adaptive Parameter Update for Multi-Agent Path Finding with Stochastic Travel Times
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.