Explore the vast range of titles available.

With the development of robotics technology, there is a growing demand for robots to perform path planning autonomously. Therefore, rapidly and safely planning travel routes has become an important research direction for autonomous mobile robots. This paper elaborates on traditional path-planning algorithms and the limitations of these algorithms in practical applications. Meanwhile, in response to these limitations, it reviews the current research status of recent improvements to these traditional algorithms. The results indicate that these improved path-planning algorithms perform well in tests or practical applications, and multi-algorithm fusion for path planning outperforms single-algorithm path planning.

Path planning creates the shortest path from the source to the destination based on sensory information obtained from the environment. Within path planning, obstacle avoidance is a crucial task in robotics, as the autonomous operation of robots needs to reach their destination without collisions. Obstacle avoidance algorithms play a key role in robotics and autonomous vehicles. These algorithms enable robots to navigate their environment efficiently, minimizing the risk of collisions and safely avoiding obstacles. This article provides an overview of key obstacle avoidance algorithms, including classic techniques such as the Bug algorithm and Dijkstra’s algorithm, and newer developments like genetic algorithms and approaches based on neural networks. It analyzes in detail the advantages, limitations, and application areas of these algorithms and highlights current research directions in obstacle avoidance robotics. This article aims to provide comprehensive insight into the current state and prospects of obstacle avoidance algorithms in robotics applications. It also mentions the use of predictive methods and deep learning strategies.

This paper summarizes in depth the state of the art of aerial swarms, covering both classical and new reinforcement-learning-based approaches for their management. Then, it proposes a hybrid AI system, integrating deep reinforcement learning in a multi-agent centralized swarm architecture. The proposed system is tailored to perform surveillance of a specific area, searching and tracking ground targets, for security and law enforcement applications. The swarm is governed by a central swarm controller responsible for distributing different search and tracking tasks among the cooperating UAVs. Each UAV agent is then controlled by a collection of cooperative sub-agents, whose behaviors have been trained using different deep reinforcement learning models, tailored for the different task types proposed by the swarm controller. More specifically, proximal policy optimization (PPO) algorithms were used to train the agents’ behavior. In addition, several metrics to assess the performance of the swarm in this application were defined. The results obtained through simulation show that our system searches the operation area effectively, acquires the targets in a reasonable time, and is capable of tracking them continuously and consistently.

Product defect inspection is critical in industrial applications; however, it remains increasingly challenging in mass production environments, particularly for glossy or curved surface products. Conventional inspection of such surfaces typically relies on manual visual examination using gauges and operator judgment, which is time consuming and prone to inconsistency. This study proposes a robust defect detection framework for curved and reflective surfaces using a KEYENCE displacement laser sensor. The system integrates the Dijkstra algorithm, the Nearest Neighbor Algorithm, and a Genetic Algorithm to optimize the laser scanning path for structured image data generation. To validate the proposed framework, datasets were generated from both healthy and defective samples and used to train multiple deep learning models. A comparative analysis was conducted using YOLOv8, YOLOv9, YOLOv10, and YOLOv11 architectures. Experimental results demonstrate that YOLOv11 achieved the best overall performance, attaining an mAP50 score of 0.844 while also exhibiting lower computational complexity and faster inference.

Future autonomous transportation is one of the most demanding application areas in terms of connectivity, as it has to simultaneously meet stringent criteria that do not typically go hand in hand, such as high throughput, low latency, high coverage/availability, high positioning and sensing accuracies, high security and robustness to interferences, etc. In order to meet the future demands of challenging applications, such as applications relying on autonomous vehicles, terrestrial networks are no longer sufficient and are to be augmented in the future with satellite-based networks. Among the emerging satellite networks, Low Earth Orbit (LEO) networks are able to provide advantages over traditional Medium Earth Orbit (MEO) and Geo-Stationary Earth Orbit (GEO) networks in terms of signal latency, cost, and performance. Nevertheless, several challenges exist in LEO system design, which have not been fully addressed in the existing literature. In particular, the problem of LEO-system optimization of design parameters is a multi-dimensional problem with many aspects to be considered. This paper offers a comprehensive survey of the LEO-system design parameters, of the challenges in LEO system design process, and of the optimization methods for satellite communication, positioning, and sensing applications, as well as a summarizing discussion on the design considerations for LEO-based networks to support future autonomous transportation.

Planning the path of a mobile robot that must transport and deliver small packages inside a multi-story building is a problem that requires a combination of spatial and operational information, such as the location of origin and destination points and how to interact with elevators. This paper presents a solution to this problem, which has been formulated under the following assumptions: (1) the map of the building’s floors is available; (2) the position of all origin and destination points is known; (3) the mobile robot has sensors to self-localize on the floors; (4) the building is equipped with remotely controlled elevators; and (5) all doors expected in a delivery route will be open. We start by defining a static navigation tree describing the weighted paths in a multi-story building. We then proceed to describe how this navigation tree can be used to plan the route of a mobile robot and estimate the total length of any delivery route using Dijkstra’s algorithm. Finally, we show simulated routing results that demonstrate the effectiveness of this proposal when applied to an autonomous delivery robot operating in a multi-story building.

With the continued development of artificial intelligence technology, unmanned surface vehicles (USVs) have attracted the attention of countless domestic and international specialists and academics. In particular, path planning is a core technique for the autonomy and intelligence process of USVs. The current literature reviews on USV path planning focus on the latest global and local path optimization algorithms. Almost all algorithms are optimized by concerning metrics such as path length, smoothness, and convergence speed. However, they also simulate environmental conditions at sea and do not consider the effects of sea factors, such as wind, waves, and currents. Therefore, this paper reviews the current algorithms and latest research results of USV path planning in terms of global path planning, local path planning, hazard avoidance with an approximate response, and path planning under clustering. Then, by classifying USV path planning, the advantages and disadvantages of different research methods and the entry points for improving various algorithms are summarized. Among them, the papers which use kinematic and dynamical equations to consider the ship’s trajectory motion planning for actual sea environments are reviewed. Faced with multiple moving obstacles, the literature related to multi-objective task assignment methods for path planning of USV swarms is reviewed. Therefore, the main contribution of this work is that it broadens the horizon of USV path planning and proposes future directions and research priorities for USV path planning based on existing technologies and trends.

Ground autonomous mobile robots are increasingly critical for reconnaissance, patrol, and resupply tasks in public safety and national defense scenarios, where global path planning in 3D uneven terrains remains a major challenge. Traditional planners struggle with high dimensionality, while Deep Reinforcement Learning (DRL) is hindered by two key issues: (1) systematic overestimation of action values (Q-values) due to function approximation error, which leads to suboptimal policies and training instability; and (2) inefficient exploration under sparse reward signals. To address these limitations, we propose DSAC-ICM: a Distributional Soft Actor–Critic framework integrated with an Intrinsic Curiosity Module (ICM). Our method fundamentally shifts the learning paradigm from estimating scalar Q-values to learning the full probability distribution of state-action returns, which inherently mitigates value overestimation. We further integrate the ICM to generate dense intrinsic rewards, guiding the agent toward novel and unvisited states to tackle the exploration challenge. Comprehensive experiments conducted in a suite of realistic 3D uneven-terrain environments demonstrate that DSAC-ICM successfully enables the agent to learn effective navigation capabilities. Crucially, it achieves a superior trade-off between path quality and computational cost when compared to traditional path planning algorithms. Furthermore, DSAC-ICM significantly outperforms other RL baselines in terms of convergence speed and return.

The original concept of the artificial potential field in robot path planning has spawned a variety of extensions to address its main weakness, namely the formation of local minima in which the robot may be trapped. In this paper, a smooth navigation function combining the Dijkstra-based discrete static potential field evaluation with bilinear interpolation is proposed. The necessary modifications of the bilinear interpolation method are developed to make it applicable to the path-planning application. The effect is that the strategy makes it possible to solve the problem of the local minima, to generate smooth paths with moderate computational complexity, and at the same time, to largely preserve the product of the computationally intensive static plan. To cope with detected changes in the environment, a simple planning strategy is applied, bypassing the static plan with the solution of the A* algorithm to cope with dynamic discoveries. Results from several test environments are presented to illustrate the advantages of the developed navigation model.

Path-planning algorithms for planetary rovers are critical for autonomous robotic exploration, enabling the efficient and safe traversal of complex and dynamic extraterrestrial terrains. Unlike terrestrial mobile robots, planetary rovers must navigate highly unpredictable environments influenced by diverse factors such as terrain variability, obstacles, illumination conditions, and temperature fluctuations, necessitating advanced path-planning strategies to ensure mission success. This review comprehensively synthesizes recent advancements in planetary rover path-planning algorithms. First, we categorize these algorithms from a constraint-oriented perspective, distinguishing between internal rover state constraints and external environmental constraints. Next, we examine rule-based path-planning approaches, including graph search-based methods, potential field methods, sampling-based techniques, and dynamic window approaches, analyzing representative algorithms in each category. Subsequently, we explore bio-inspired path-planning methods, such as evolutionary algorithms, fuzzy computing, and machine learning-based approaches, with a particular emphasis on the latest developments and prospects of machine learning techniques in planetary rover navigation. Finally, we synthesize key insights from existing algorithms and discuss future research directions, highlighting their potential applications in planetary exploration missions.