Now, a research team led by Zhe Sun, Shujie Hu, Xinan Miao, and Bo Chen of Zhejiang University of Technology in Hangzhou, China, together with Jinchuan Zheng and Zhihong Man of Swinburne University of Technology in Melbourne, Australia, and Tian Wang of Hangzhou RoboCT Technology Development Co. Ltd., has unveiled an integrated control framework that promises to make these agile robots far more capable of navigating cluttered environments on their own. Published in Frontiers in Control Engineering, their study tackles two of the most vital technologies for autonomous movement: trajectory planning and trajectory-tracking control. The work arrives at a moment when mobile robots are being deployed ever more widely, and when the ability to plan a path around obstacles in real time, and then follow that path with precision, separates a genuinely autonomous machine from a remote-controlled toy.

Trajectory planning, in essence, means generating a series of reference position-and-posture signals for a mobile robot based on environmental information perceived by its sensors, while respecting the robot’s kinematic constraints and accounting for surrounding obstacles. Planning strategies fall into two broad categories. Global planning algorithms require all environmental information in advance and take considerable time to execute, which makes them difficult to implement in real settings. Local planning, by contrast, possesses a stronger real-time property because it uses sensor-collected information to iteratively update the reference trajectory as the robot moves. Typical local planning approaches include fuzzy logic methods, neural network methods, and artificial potential field (APF) methods. The APF scheme is particularly elegant: it treats the target and obstacles as objects exerting virtual forces on the robot, with the target generating an attractive force and obstacles generating repulsive forces. The resultant of these virtual forces indicates the robot’s moving direction, guiding it smoothly around hazards and toward its destination. Because APF-based strategies offer smooth trajectory generation and real-time obstacle avoidance, they play a key role in mobile robot navigation.

The Zhejiang-led team harnessed this potential field concept with a thoughtful piecewise design. Their attractive-field function depends on the distance between the robot and the target at each sampling moment, modulated by an attractive-field parameter and a switching distance threshold. The purpose of the piecewise structure is to prevent an overlarge attractive force when the robot is far from its goal. If the attractive force were always proportional to distance, the robot would be forced to rush at high velocity from the starting point. Instead, a constant attractive force is exerted on the robot until it enters an area of predetermined radius around the destination, at which point the force becomes proportional to the remaining distance, allowing a gentle arrival. On the repulsive side, the field function depends on the distance between each obstacle and the robot, scaled by a repulsive-field coefficient and limited to a maximum acting range. Beyond that range, an obstacle exerts no influence at all, keeping the virtual force landscape clean and computationally efficient. The resultant force, decomposed along the X and Y axes, generates reference velocities that serve as the reference signal for the tracking control system.

Planning a trajectory is only half the battle; the robot must then follow it accurately despite disturbances, friction variations, and model uncertainties. For this task, the researchers turned to sliding mode control, a strategy widely utilized in mechatronic engineering practice owing to its superior performance and firm robustness in handling external disturbances and model uncertainties. Conventional sliding mode control, however, can only realize asymptotic convergence, meaning errors decay gradually rather than vanishing in finite time. To overcome this shortage, terminal sliding mode control was developed to enhance convergence speed and suppress the chattering phenomenon, and a subsequent non-singular terminal sliding mode method addressed the singularity problem inherent in the classical formulation, finding applications in systems ranging from vehicle steer-by-wire to servomotor-driven rigid robots.

The team’s contribution goes a step further by embracing the discrete nature of modern computer control. As embedded controllers grow more powerful, more control algorithms are implemented by computer systems that operate with sampling periods, during which the control input signal remains constant. This discrete reality creates a fundamental problem for sliding mode control: while discrete control inputs can bring system states close to the sliding surface, they usually cannot make the states stay on it. Directly applying a continuous sliding mode algorithm to a sampled-data system may harm stability and even result in loss of control. The researchers therefore designed a discrete integral terminal sliding mode (DITSM) control algorithm specifically suited to computer implementation, building on established concepts of quasi-sliding mode and quasi-sliding mode bands from the discrete-time variable structure control literature.

The DITSM controller operates on a velocity error defined as the difference between the reference velocity signal and the robot’s actual velocity. A sliding surface is constructed that combines the current error with an integral term of a fractional power, with parameters chosen as odd integers whose ratio approaches one. The closer this ratio is to one, the closer the surface is to a proportional one, yielding smoother control input but slower convergence. The researchers selected a ratio of three-fifths as a considered tradeoff. The total control input is composed of two parts: an equivalent control input, derived by temporarily neglecting the lumped parametric uncertainties, and a reaching control input that handles those uncertainties through a switching gain. A key practical merit of the design is that the switching gain is defined in terms of a single tunable parameter, which reduces the difficulty of tuning and simplifies the stability analysis considerably.

Stability was not left to intuition. The team constructed a discrete-time Lyapunov function and carried out a classified discussion covering all sign combinations of the sliding variables, proving that each component converges into a bounded region in finite steps and, once inside, cannot escape. Building on a lemma concerning discrete-time terminal sliding surfaces, they further showed that the tracking error itself converges into a bounded region after finitely many steps. The researchers also elaborated a detailed tuning guideline: increasing the integral coefficient accelerates convergence and keeps small steady-state errors, though an overlarge value may cause instability, while a larger boundary parameter accelerates error convergence at the cost of intensifying chattering. Benchmark controllers, a discrete conventional sliding mode controller and a discrete terminal sliding mode controller, were designed for comparison.

Simulations in MATLAB verified the framework in two scenarios. In the static-obstacle case, the robot started at the origin with a target fifteen meters away, and five static obstacles were scattered along the corridor. The attractive-field coefficient was set to 0.5, the repulsive-field coefficient to 8, the switching distance to 5 meters, and the maximum repulsive range to 3 meters, with motor output torque limited to 0 to 15 newton-meters to mimic motor protection and a sampling period of 0.01 seconds. The trajectory-planning algorithm updated every 20 sampling periods, balancing computation load and operational efficiency, while the robot’s heading angle remained fixed at zero to showcase its omnidirectional movement. Results showed the DITSM controller achieved the fastest convergence rate in X-axis velocity error, with the DTSM and DCSM controllers ranking second and slowest. Y-axis velocity errors exhibited oscillations because the planning algorithm updates every 20 sampling periods, but the oscillation amplitude under DITSM was the smallest, peaking at only 0.05 meters per second. The initial control action of the DITSM system was the strongest, explaining its fast convergence.

In the dynamic-obstacle case, the third and fourth obstacles were set in motion along the Y-axis at velocities of 1 meter per second and 0.5 meters per second respectively, within defined ranges. Screenshots of the robot’s trajectory at half-second intervals showed the APF-based planning scheme updating the reference trajectory according to the moving obstacles’ positions and guiding the robot around them. Under the DITSM control law, the robot realized satisfactory dynamic obstacle avoidance, with the fastest velocity-error convergence rate, the fastest transient response, and the smallest error oscillations compared with the benchmarks. The findings indicate that the proposed planning-and-control method achieves effective obstacle avoidance in both static and dynamic scenarios, with higher tracking accuracy and firmer robustness than the benchmark controllers. For a robot class already prized for moving in any direction without a swerve, this work adds the intelligence to do so safely among moving hazards, a combination that could accelerate deployment of MWOMRs in warehouses, factories, and beyond.

Subject of Research: Artificial potential field trajectory planning and discrete integral terminal sliding mode tracking control of a Mecanum-wheeled omnidirectional mobile robot

Article Title: Obstacle-avoidance trajectory planning and sliding mode-based tracking control of an omnidirectional mobile robot

Article References: Sun, Z., Hu, S., Miao, X., Chen, B., Zheng, J., Man, Z., & Wang, T. (2023). Obstacle-avoidance trajectory planning and sliding mode-based tracking control of an omnidirectional mobile robot. Frontiers in Control Engineering, 4, Article 1135258. https://doi.org/10.3389/fcteg.2023.1135258

Image Credits: AI Generated

DOI: 10.3389/fcteg.2023.1135258

Keywords: omnidirectional mobile robot, Mecanum wheels, obstacle avoidance, trajectory planning, trajectory tracking, sliding mode control, artificial potential field, discrete control, Lyapunov stability, autonomous robots, robotics, control engineering

The heart of the contribution is what Toro-Arcila calls an analytical safety boundary, denoted mathematically as δ_safe. Rather than relying on a fixed, hand-tuned safety margin around obstacles — the approach taken by most traditional reactive avoidance schemes — the new method computes this boundary on the fly, coupling the physical size of the drone and the obstacle with the optical limits of the onboard camera. The result is a safety distance that automatically adapts when the hardware changes or when environmental conditions shift. Swap in a camera with a different field of view, or encounter an obstacle of a different size, and the framework recalculates its safety envelope without any manual retuning by an engineer.

This adaptability matters because field-of-view constraints are not a minor detail in visual servoing; they are the defining constraint of the entire control problem. In IBVS, the controller drives the vehicle by minimizing the error between the current image of a target and a desired reference image. If the target leaves the image plane, the error signal becomes meaningless and the control loop effectively breaks. The new framework addresses this by deriving its safety boundary directly from the camera’s optical geometry, ensuring that any avoidance maneuver the system executes remains compatible with keeping the target visible. The paper demonstrates this robustness through parametric analyses across three distinct optical configurations — cameras with 45-degree, 69-degree, and 110-degree fields of view — showing that the UAV circumvents obstacles without scenario-specific recalibration in any of them.

Another stubborn problem the study tackles is what the author terms the “Target-as-Obstacle” paradox. In cluttered environments, the very object a drone is trying to approach can be classified by its perception system as an obstacle, creating a logical contradiction: the avoidance layer pushes the vehicle away from the goal the navigation layer is trying to reach. Conventional systems often resolve this conflict with hard-switching mechanisms that abruptly toggle between avoidance and navigation modes, producing flight instabilities or unnecessary lateral deviations that can shake the target out of view. Toro-Arcila’s solution is a localized 3D perception pipeline that resolves the paradox at runtime without requiring a dense global map of the environment, a significant advantage for lightweight drones with limited onboard computing.

The mathematical machinery behind the avoidance maneuver is equally noteworthy. The framework uses a continuously differentiable activation function to project secondary navigation commands into the obstacle’s null-space — a concept borrowed from redundant manipulator control, where motions that would violate a constraint are mathematically filtered out of the command signal. By structurally decoupling the collision avoidance constraint from the navigation objective, the safety layer never fights the navigation controller; instead, it reshapes the command space so that both objectives can coexist. This modularity means the safety layer can be bolted onto existing low-level UAV autopilots and works with both image-based visual servoing and coordinate-based pose control, making it practical for integration into a wide range of existing platforms.

Safety claims in robotics are only as good as the theory backing them, and the study grounds its architecture in formal control-theoretic guarantees. The formulation is supported by Lyapunov stability analysis and positive invariant set analysis, providing theoretical safety bounds for collision avoidance at the kinematic level. In plain terms, Lyapunov analysis demonstrates that the system’s error dynamics converge rather than diverge, while invariant set arguments show that once the drone enters a provably safe region of its state space, it cannot leave it. These are the kinds of guarantees that distinguish an engineering curiosity from a certifiable flight-critical system, and they are notably absent from many heuristic obstacle avoidance methods in the literature.

The paper also addresses a subtle but critical phase of flight: terminal docking, the final moments when a drone approaches its target to land or perch. During this phase, many actuators exhibit deadbands — small regions around the zero command where the motors produce no response — which can cause jittery, imprecise motion precisely when precision matters most. Toro-Arcila introduces an adaptive gain scheduling technique that adjusts the controller’s responsiveness to mitigate these deadband effects, smoothing the terminal approach. It is the kind of unglamorous detail that separates simulation demos from systems that can actually touch down reliably on a physical platform.

To benchmark the approach, the author ran comparative simulations against a classical artificial potential field (APF) baseline, one of the oldest and most widely used reactive avoidance methods. APF schemes steer robots away from obstacles using repulsive forces and toward goals using attractive forces, but they are notorious for requiring careful parameter tuning per scenario and for trapping vehicles in local minima. The comparative results, alongside the parametric sweeps across camera configurations and obstacle dimensions, show that the proposed framework maintains reliable avoidance behavior under optical scaling and coupled spatial trajectories — conditions under which a statically tuned APF would typically need to be re-parameterized or would fail outright. The simulation work was conducted in the CoppeliaSim robotics framework, and supplementary video material accompanies the publication.

The broader context makes the work timely. Drones are being deployed at scale in precision agriculture, search and rescue, forest ecology monitoring, surveillance, and the emerging low-altitude economy, where vehicles must operate autonomously in cluttered, GPS-denied, or visually complex environments. Vision-based control is attractive in these settings because cameras are lightweight, inexpensive, and passive, but the field has long struggled to reconcile the competing demands of target tracking and obstacle avoidance. Related research efforts — from control barrier functions and model predictive control to reinforcement learning-based planners — attack pieces of the problem, but often at the cost of heavy computation, dense mapping requirements, or scenario-specific training. The analytical, lightweight nature of the new approach positions it as a complementary safety layer rather than a replacement for these heavier planning stacks.

There are, of course, limits to what the current study demonstrates. The validation is simulation-based, the source code and simulation framework are not yet publicly available due to ongoing intellectual property protection procedures, and the safety guarantees hold at the kinematic level, meaning dynamic effects such as wind gusts, actuator saturation, and aggressive maneuvers remain outside the formal bounds. The author notes that numerical data are available upon reasonable request, and access to the code may be granted for legitimate academic purposes. Still, the core idea — deriving a provable safety boundary from the interplay of camera optics and physical geometry, and enforcing it through null-space projection rather than brittle mode switching — offers a compelling template for the next generation of vision-guided aerial robots. If the approach survives the transition from simulation to hardware, drones that can chase a target through cluttered spaces without ever losing sight of it may become the norm rather than the exception.

Subject of Research: Reactive obstacle avoidance for image-based visual servoing control of unmanned aerial vehicles

Article Title: Reactive Obstacle Avoidance in UAV Visual Servoing: An Analytical Safety Boundary Approach Under FOV Constraints

Article References: Toro-Arcila, C. A. (2026). Reactive Obstacle Avoidance in UAV Visual Servoing: An Analytical Safety Boundary Approach Under FOV Constraints. International Journal of Aeronautical and Space Sciences. https://doi.org/10.1007/s42405-026-01310-8

Image Credits: AI Generated

DOI: 10.1007/s42405-026-01310-8

Keywords: UAV, visual servoing, obstacle avoidance, IBVS, field of view, null-space projection, Lyapunov stability, drone control, artificial potential field, hierarchical control, autonomous navigation, safety boundary

The core challenge the researchers set out to solve is deceptively simple to state: given a start point and a goal in a cluttered 3D environment, generate a trajectory that is short, smooth, dynamically feasible, and energy-efficient, all at the same time. These objectives frequently conflict with one another. The shortest path may hug obstacles so tightly that a real aircraft could not safely follow it. The smoothest path may waste energy in wide, sweeping arcs. Traditional optimization methods can balance these goals but often struggle in unknown or changing environments, where they must be re-run from scratch whenever conditions shift.

Deep reinforcement learning has emerged in recent years as an attractive end-to-end alternative. In this paradigm, an artificial intelligence agent learns to fly by trial and error, receiving rewards for progress toward the goal and penalties for collisions, erratic motion, or excessive energy use. Over many training episodes, the agent internalizes a policy that maps what it observes directly to the actions it should take. The appeal is obvious: once trained, such a policy can react to new situations in milliseconds without recomputing a full trajectory. The drawback, as the new paper emphasizes, is that learning from scratch is painfully slow. Random exploration in a vast three-dimensional action space means the agent spends most of its early training bumping into obstacles or wandering aimlessly, a problem the authors describe as blind exploration combined with low sample efficiency.

To inject common sense into this process, the team turned to the artificial potential field, a concept that has guided robot navigation since the 1980s. In an artificial potential field, the goal exerts an attractive force that pulls the vehicle toward it, while obstacles exert repulsive forces that push it away. The drone is imagined as a ball rolling downhill on a landscape sculpted by these forces, and at every instant the field suggests a sensible direction of travel. The elegance of the approach is that the guidance is state-dependent: as the drone’s position and surroundings change, the forces change with them, always pointing toward safer, more productive regions of space.

Rather than replacing the learning algorithm with this classical method, the researchers fused the two. The state-dependent forces generated by the artificial potential field are integrated directly with the policy of a Soft Actor–Critic agent, a state-of-the-art deep reinforcement learning algorithm prized for its stability and its ability to balance exploration against exploitation. Soft Actor–Critic maximizes both the expected reward and the entropy, or randomness, of the agent’s behavior, which prevents it from collapsing prematurely into a mediocre strategy. By blending the potential field’s heuristic push into the action-selection process, the hybrid system no longer explores blindly. From the very first training episode, the agent is nudged in directions that the physics suggests are promising, while retaining the freedom to deviate when the heuristic is wrong, as it can be in local minima where attractive and repulsive forces cancel out.

The second innovation addresses a different weakness: memory. Standard actor–critic networks treat each moment in isolation, deciding what to do based only on the current observation. A flying vehicle, however, is a dynamical system whose future depends on its recent past. A sudden change in heading that was perfectly safe at low speed may be catastrophic at high speed, and the network cannot know the difference if it has no access to the sequence of states that led to the present moment. To capture these temporal dependencies, the authors embedded a long short-term memory, or LSTM, structure into both the actor and the critic networks. LSTMs are recurrent neural networks equipped with gating mechanisms that allow them to retain information over many time steps and to forget what is no longer relevant, giving the agent an effective working memory of its own flight history.

The practical consequence of this architectural choice is smoother, more dynamically feasible trajectories. Because the policy can perceive trends, accelerations, and oscillations in the state sequence rather than single snapshots, it learns to produce control commands that flow naturally from one to the next, avoiding the jerky, high-frequency corrections that plague memoryless policies and that translate directly into wasted energy and mechanical stress on real airframes. The combination of potential field guidance and recurrent memory gives the method its name: APF–LSTM–SAC.

The team validated the approach in comprehensive tests within complex simulated three-dimensional environments, comparing it against pure deep reinforcement learning baselines. The results were striking. The hybrid method achieved improvements in convergence speed of at least 15.14 percent, meaning the agent reached competent flight policies substantially faster than its unguided counterparts, and it reduced energy consumption by at least 10.36 percent, a figure that matters enormously for battery-powered aircraft whose mission endurance is measured in minutes. Faster training also carries a practical dividend: fewer simulated flight hours are needed before a policy is deployable, which lowers the computational cost of developing autonomous capabilities for new vehicle types or new environments.

The significance of the work extends beyond the specific percentages. It exemplifies a growing trend in robotics toward physics-informed machine learning, in which decades of classical control theory and heuristic reasoning are used to scaffold, rather than be replaced by, modern data-driven methods. Pure learning systems must rediscover from scratch lessons that engineers already know, such as the fact that obstacles should be avoided and goals approached. By encoding those lessons as inductive biases inside the learning pipeline, researchers can preserve the adaptability of reinforcement learning while dramatically shrinking the search space the algorithm must explore. The potential field component supplies a sensible prior; the LSTM supplies temporal awareness; and the Soft Actor–Critic framework supplies robust, entropy-regularized optimization that can gracefully reconcile the two.

The authors note that the datasets generated and analyzed during the study are available from the corresponding author on reasonable request, and the work was supported by the National Natural Science Foundation of China, the CAAC Key Laboratory of General Aviation Operation, and the Fundamental Research Funds for the Central Universities. As drones take on ever more ambitious roles, from delivering medical supplies to surveying disaster zones, the ability to plan safe, efficient three-dimensional trajectories autonomously will only grow in importance. Hybrid approaches like APF–LSTM–SAC suggest that the fastest route to capable autonomous flight may not be to make learning algorithms bigger, but to make them wiser, by letting the accumulated physics of navigation light the way through the darkness of blind exploration.

Subject of Research: UAV three-dimensional path planning using artificial potential field guidance and an LSTM-enhanced Soft Actor–Critic deep reinforcement learning algorithm

Article Title: UAV 3D Path Planning Based on Artificial Potential Field Guidance and LSTM-Enhanced Soft Actor–Critic

Article References: Liu, J., Zhou, H., Lei, X., Tu, X., Hua, H., & Wang, X. (2026). UAV 3D Path Planning Based on Artificial Potential Field Guidance and LSTM-Enhanced Soft Actor–Critic. International Journal of Aeronautical and Space Sciences. https://doi.org/10.1007/s42405-026-01292-7

Image Credits: AI Generated

DOI: 10.1007/s42405-026-01292-7

Keywords: UAV path planning, deep reinforcement learning, artificial potential field, Soft Actor–Critic, long short-term memory, drone navigation, trajectory optimization, energy efficiency, 3D path planning, autonomous flight, machine learning, robotics