OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

A Convex Optimization Approach to Multi-Robot Task Allocation and Path Planning
Tingjun Lei, Pradeep Chintam, Chaomin Luo, et al.
Sensors (2023) Vol. 23, Iss. 11, pp. 5103-5103
Open Access | Times Cited: 18

Showing 18 citing articles:

Graph-based robot optimal path planning with bio-inspired algorithms
Tingjun Lei, Timothy Sellers, Chaomin Luo, et al.
Biomimetic Intelligence and Robotics (2023) Vol. 3, Iss. 3, pp. 100119-100119
Open Access | Times Cited: 24

Informed sampling space driven robot informative path planning
Pradeep Chintam, Tingjun Lei, Batuhan Osmanoğlu, et al.
Robotics and Autonomous Systems (2024) Vol. 175, pp. 104656-104656
Closed Access | Times Cited: 7

The Wide-Area Coverage Path Planning Strategy for Deep-Sea Mining Vehicle Cluster Based on Deep Reinforcement Learning
Bowen Xing, Xiao Wang, Zhenchong Liu
Journal of Marine Science and Engineering (2024) Vol. 12, Iss. 2, pp. 316-316
Open Access | Times Cited: 7

Digital twin‐based multi‐objective autonomous vehicle navigation approach as applied in infrastructure construction
Tingjun Lei, Timothy Sellers, Chaomin Luo, et al.
IET Cyber-Systems and Robotics (2024) Vol. 6, Iss. 2
Open Access | Times Cited: 5

Target-driven dynamic coverage planning method for marsupial cluster system
Z. H. Lu, Chaoping Liang, Bai Chen, et al.
Advanced Engineering Informatics (2025) Vol. 64, pp. 103071-103071
Closed Access

Real-time distributed decision-making for simultaneous target assignment and path planning in multiple unmanned surface vehicles
Shihong Yin, Zhengrong Xiang
Expert Systems with Applications (2025) Vol. 279, pp. 127457-127457
Closed Access

Bio-Inspired Intelligence-Based Multiagent Navigation With Safety-Aware Considerations
Tingjun Lei, Chaomin Luo, Simon X. Yang, et al.
IEEE Transactions on Artificial Intelligence (2023) Vol. 5, Iss. 6, pp. 2946-2961
Closed Access | Times Cited: 5

Coverage Planning for UVC Irradiation: Robot Surface Disinfection Based on Swarm Intelligence Algorithm
Peiyao Guo, Dekun Luo, Yizhen Wu, et al.
Sensors (2024) Vol. 24, Iss. 11, pp. 3418-3418
Open Access

Multi-robot path planning using potential field-based simulated annealing approach
Saleh Alarabi, Tingjun Lei, Michael Santora, et al.
(2024)
Closed Access

Optimal Multi-target Navigation via Graph-based Algorithms in Complex Environments
Brandon Black, Timothy Sellers, Tingjun Lei, et al.
(2024), pp. 1-6
Closed Access

Efficient Multi-Robot Cooperative Transportation Scheduling System
Xiaodong Li, Yangfei Lin, Zhaoyang Du, et al.
(2024), pp. 449-454
Closed Access

Toward a Generic Framework for Mission Planning and Execution with a Heterogeneous Multi-Robot System
Mohsen Denguir, Ameur Touir, Achraf Gazdar, et al.
Sensors (2024) Vol. 24, Iss. 21, pp. 6881-6881
Open Access

Intelligent multi-robot collaborative transport system
Xiaodong Li, Yangfei Lin, Zhaoyang Du, et al.
Urban Lifeline (2024) Vol. 2, Iss. 1
Open Access

Path Planning Approaches in Multi‐robot System: A Review
Semonti Banik, Sajal Chandra Banik, Sarker Safat Mahmud
Engineering Reports (2024)
Open Access

Hybrid Form of Differential Evolutionary and Gray Wolf Algorithm for Multi-AUV Task Allocation in Target Search
Ziyun Chen, Dengsheng Zhang, Cheng‐Xiang Wang, et al.
Electronics (2023) Vol. 12, Iss. 22, pp. 4575-4575
Open Access | Times Cited: 1

Multi-Robot Path Planning based on Ant Colony Algorithm
Li Li, Kan Jin, Xin‐Ye Zou
(2023), pp. 1-4
Closed Access

Page 1

Scroll to top