On the public citation graph
Path Planning Approaches in Multi‐robot System: A Review
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.
1 of the 109 references listed on this page is in the Retraction Watch database as retracted (export 2026-11-11): 10.3233/jifs-220886 (notice 2025-01-15).
Dataset join, best-effort; this page does not check the publisher record.
Retraction Watch data via Crossref Labs, used with credit; OpenCitations Index (CC0) and Meta (CC BY 4.0);
dataset doi:10.7910/DVN/WT8VOA (CC BY 4.0).
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/j.net.2023.02.005openalex-snapshotMulti-objective path planning for mobile robot in nuclear accident environment based on improved ant colony optimization with modified A∗
inferredcites →https://doi.org/10.1111/coin.12547openalex-snapshotHybrid approach to implement multi‐robotic navigation system using neural network, fuzzy logic, and bio‐inspired optimization methodologies
inferredcites →https://doi.org/10.3390/app11209650openalex-snapshotA Path Planning Strategy for Multi-Robot Moving with Path-Priority Order Based on a Generalized Voronoi Diagram
inferredcites →https://doi.org/10.3390/app13116757openalex-snapshotTime-Optimal Trajectory Planning for the Manipulator Based on Improved Non-Dominated Sorting Genetic Algorithm II
inferredcites →https://doi.org/10.3390/rs14153720openalex-snapshotFPS: Fast Path Planner Algorithm Based on Sparse Visibility Graph and Bidirectional Breadth-First Search
inferredcites →https://doi.org/10.3390/s22228983openalex-snapshotAn Optimized Probabilistic Roadmap Algorithm for Path Planning of Mobile Robots in Complex Environments with Narrow Channels
inferredcites →https://doi.org/10.3390/s23208533openalex-snapshotHierarchical Area-Based and Path-Based Heuristic Approaches for Multirobot Coverage Path Planning with Performance Analysis in Surveillance Systems
inferredcites →https://doi.org/10.3390/sym11101241openalex-snapshotCloud-Based Multi-Robot Path Planning in Complex and Crowded Environment with Multi-Criteria Decision Making Using Full Consistency Method
inferredcites →https://doi.org/10.3934/mbe.2023165openalex-snapshotConflict-free and energy-efficient path planning for multi-robots based on priority free ant colony optimization
inferredcites →https://doi.org/10.65109/mswt8766openalex-snapshotAsynchronous Multi-Agent Reinforcement Learning for Efficient Real-Time Multi-Robot Cooperative Exploration
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/eng2.70009openalex-snapshotStudy on Multiobjective Path Optimization of Plant Protection Robots Based on Improved ACO ‐ DWA Algorithm
inferred← citeshttps://doi.org/10.1002/eng2.70369openalex-snapshotADAR‐Seg : A Lightweight Network With Adaptive Dependency and Receptive Fields for Point Cloud Segmentation in Dynamic
inferred← citeshttps://doi.org/10.1007/s10462-025-11472-8openalex-snapshotIntelligent hybrid optimization algorithms for multi-agent aerial robots path planning: review of the recent emerging trends and open research directions
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.