D-Point Trigonometric Path Planning based on Q-Learning in Uncertain Environments

Finding the optimum path for a robot for moving from start to the goal position through obstacles is still a challenging issue. This paper presents a novel path planning method, named D-point trigonometric, based on Q-learning algorithm for dynamic and uncertain environments, in which all the obstacles and the target are moving. We define a new state, action and reward functions for the Q-learning by which the agent can find the best action in every state to reach the goal in the most appropriate path. The D-point approach minimizes the possible number of states. Moreover, the experiments in Unity3D confirmed the high convergence speed, the high hit rate, as well as the low dependency on environmental parameters of the proposed method compared with an opponent approach

Cellular Automata Applications in Shortest Path Problem

Cellular Automata (CAs) are computational models that can capture the essential features of systems in which global behavior emerges from the collective effect of simple components, which interact locally. During the last decades, CAs have been extensively used for mimicking several natural processes and systems to find fine solutions in many complex hard to solve computer science and engineering problems. Among them, the shortest path problem is one of the most pronounced and highly studied problems that scientists have been trying to tackle by using a plethora of methodologies and even unconventional approaches. The proposed solutions are mainly justified by their ability to provide a correct solution in a better time complexity than the renowned Dijkstra's algorithm. Although there is a wide variety regarding the algorithmic complexity of the algorithms suggested, spanning from simplistic graph traversal algorithms to complex nature inspired and bio-mimicking algorithms, in this chapter we focus on the successful application of CAs to shortest path problem as found in various diverse disciplines like computer science, swarm robotics, computer networks, decision science and biomimicking of biological organisms' behaviour. In particular, an introduction on the first CA-based algorithm tackling the shortest path problem is provided in detail. After the short presentation of shortest path algorithms arriving from the relaxization of the CAs principles, the application of the CA-based shortest path definition on the coordinated motion of swarm robotics is also introduced. Moreover, the CA based application of shortest path finding in computer networks is presented in brief. Finally, a CA that models exactly the behavior of a biological organism, namely the Physarum's behavior, finding the minimum-length path between two points in a labyrinth is given.Comment: To appear in the book: Adamatzky, A (Ed.) Shortest path solvers. From software to wetware. Springer, 201

Review of Intelligent Control Systems with Robotics

Interactive between human and robot assumes a significant job in improving the productivity of the instrument in mechanical technology. Numerous intricate undertakings are cultivated continuously via self-sufficient versatile robots. Current automated control frameworks have upset the creation business, making them very adaptable and simple to utilize. This paper examines current and up and coming sorts of control frameworks and their execution in mechanical technology, and the job of AI in apply autonomy. It additionally expects to reveal insight into the different issues around the control frameworks and the various approaches to fix them. It additionally proposes the basics of apply autonomy control frameworks and various kinds of mechanical technology control frameworks. Each kind of control framework has its upsides and downsides which are talked about in this paper. Another kind of robot control framework that upgrades and difficulties the pursuit stage is man-made brainpower. A portion of the speculations utilized in man-made reasoning, for example, Artificial Intelligence (AI) such as fuzzy logic, neural network and genetic algorithm, are itemized in this paper. At long last, a portion of the joint efforts between mechanical autonomy, people, and innovation were referenced. Human coordinated effort, for example, Kinect signal acknowledgment utilized in games and versatile upper-arm-based robots utilized in the clinical field for individuals with inabilities. Later on, it is normal that the significance of different sensors will build, accordingly expanding the knowledge and activity of the robot in a modern domai

QoS multicast routing protocol oriented to cognitive network using competitive coevolutionary algorithm

The human intervention in the network management and maintenance should be reduced to alleviate the ever-increasing spatial and temporal complexity. By mimicking the cognitive behaviors of human being, the cognitive network improves the scalability, self-adaptation, self-organization, and self-protection in the network. To implement the cognitive network, the cognitive behaviors for the network nodes need to be carefully designed. Quality of service (QoS) multicast is an important network problem. Therefore, it is appealing to develop an effective QoS multicast routing protocol oriented to cognitive network. In this paper, we design the cognitive behaviors summarized in the cognitive science for the network nodes. Based on the cognitive behaviors, we propose a QoS multicast routing protocol oriented to cognitive network, named as CogMRT. It is a distributed protocol where each node only maintains local information. The routing search is in a hop by hop way. Inspired by the small-world phenomenon, the cognitive behaviors help to accumulate the experiential route information. Since the QoS multicast routing is a typical combinatorial optimization problem and it is proved to be NP-Complete, we have applied the competitive coevolutionary algorithm (CCA) for the multicast tree construction. The CCA adopts novel encoding method and genetic operations which leverage the characteristics of the problem. We implement and evaluate CogMRT and other two promising alternative protocols in NS2 platform. The results show that CogMRT has remarkable advantages over the counterpart traditional protocols by exploiting the cognitive favors

Learning Team-Based Navigation: A Review of Deep Reinforcement Learning Techniques for Multi-Agent Pathfinding

Multi-agent pathfinding (MAPF) is a critical field in many large-scale robotic applications, often being the fundamental step in multi-agent systems. The increasing complexity of MAPF in complex and crowded environments, however, critically diminishes the effectiveness of existing solutions. In contrast to other studies that have either presented a general overview of the recent advancements in MAPF or extensively reviewed Deep Reinforcement Learning (DRL) within multi-agent system settings independently, our work presented in this review paper focuses on highlighting the integration of DRL-based approaches in MAPF. Moreover, we aim to bridge the current gap in evaluating MAPF solutions by addressing the lack of unified evaluation metrics and providing comprehensive clarification on these metrics. Finally, our paper discusses the potential of model-based DRL as a promising future direction and provides its required foundational understanding to address current challenges in MAPF. Our objective is to assist readers in gaining insight into the current research direction, providing unified metrics for comparing different MAPF algorithms and expanding their knowledge of model-based DRL to address the existing challenges in MAPF.Comment: 36 pages, 10 figures, published in Artif Intell Rev 57, 41 (2024

Navigation of mobile robot in cluttered environment

Now a day’s mobile robots are widely used in many applications. Navigation of mobile robot is primary issue in robotic research field. The mobile robots to be successful, they must quickly and robustly perform useful tasks in a complex, dynamic, known and unknown surrounding. Navigation plays an important role in all mobile robots activities and tasks. Mobile robots are machines, which navigate around their environment extracting sensory information from the surrounding, and performing actions depend on the information given by the sensors. The main aim of navigation of mobile robot is to give shortest and safest path while avoiding obstacles with the help of suitable navigation technique such as Fuzzy logic. In this, we build up mobile robot then simulation and experiments are carried out in the lab. Comparison between the simulation and experimental results are done and are found to be in good

A survey of formation control and motion planning of multiple unmanned vehicles

The increasing deployment of multiple unmanned vehicles systems has generated large research interest in recent decades. This paper therefore provides a detailed survey to review a range of techniques related to the operation of multi-vehicle systems in different environmental domains, including land based, aerospace and marine with the specific focuses placed on formation control and cooperative motion planning. Differing from other related papers, this paper pays a special attention to the collision avoidance problem and specifically discusses and reviews those methods that adopt flexible formation shape to achieve collision avoidance for multi-vehicle systems. In the conclusions, some open research areas with suggested technologies have been proposed to facilitate the future research development