Autonomous Mobile Robots' performance relies on intelligent motion planning algorithms. In autonomous mobile robots, sampling-based path-planning algorithms are widely used. One of the efficient sampling-based path planning algorithms is the Rapidly Exploring Random Tree (RRT). However, the solution provided by RRT is suboptimal. An RRT extension known as RRT* is optimal, but it takes time to converge. To improve the RRT* slow convergence problem, a goal-oriented sampling-based RRT* algorithm known as GS-RRT* is proposed in this paper. The focus of the proposed research work is to reduce unwanted sample exploration and solve the slow convergence problem of RRT* by taking more samples in the vicinity of the goal region. The proposed research work is validated in three different environments with a map size of 384*384 and compared to the existing algorithms: RRT, Goal-directed RRT(G-RRT), RRT*, and Informed-RRT*. The proposed research work is compared with existing algorithms using four metrics: path length, time to find the solution, the number of nodes visited, and the convergence rate. The validation is done in the Gazebo Simulation and on a TurtleBot3 mobile robot using the Robotics Operating System (ROS). The numerical findings show that the proposed research work improves the convergence rate by an average of 33% over RRT* and 27% over Informed RRT*, and the node exploration is 26% better than RRT* and 20% better than Informed RRT*.

Path planning is a complex task in robotics, requiring an efficient and adaptive algorithm to find the shortest path in a dynamic environment. The traditional path planning methods, such as graph-based algorithms, sampling-based algorithms, reaction-based algorithms, and optimization-based algorithms, have limitations in computational efficiency, real-time adaptability, and obstacle avoidance. To address these challenges, hybrid path planning algorithms combine the strengths of multiple techniques to enhance performance. This paper includes a comprehensive review of hybrid approaches based on graph-based algorithms, sampling-based algorithms, reaction-based algorithms, and optimization-based algorithms. Also, this article discusses the advantages and limitations, supported by a comparative evaluation of computational complexity, path optimization, and finding the shortest path in a dynamic environment. Finally, we propose an AI-driven adaptive path planning approach to solve the difficulties.

Robotic systems used in industries and other complex applications need huge investment, and testing of them under robust conditions are highly challenging. Controlling and testing of such systems can be done with ease with the support of hardware-in-the-loop (HIL) simulation technique and it saves lot of time and resources. The chapter deals on the various interaction methods of robotic systems with physical environments using tactile, force, and vision sensors. It also discusses about the usage of hardware-in-the-loop technique for testing of grasp and task control algorithms in the model of robotic systems. The chapter also elaborates on usage of hardware and software platforms for implementing the control algorithms for performing physical interaction. Finally, the chapter summarizes with the case study of HIL implementation of the control algorithms in Texas Instruments (TI) C2000 microcontroller, interacting with model of Kuka’s youBot Mobile Manipulator. The mathematical model is developed using MATLAB software and the virtual animation setup of the robot is developed using the Virtual Robot Experimentation Platform (V-REP) robot simulator. By actuating the Kuka’s youBot mobile manipulator in the V-REP tool, it is observed to produce a tracking accuracy of 92% for physical interaction and object handling tasks.