A new methodology of mobile robot navigation : The agoraphilic algorithm
- McFetridge, Lachlan, Ibrahim, Yousef
- Authors: McFetridge, Lachlan , Ibrahim, Yousef
- Date: 2009
- Type: Text , Journal article
- Relation: Robotics and Computer-Integrated Manufacturing Vol. 25, no. 3 (2009 2009), p. 545-551
- Full Text: false
- Reviewed:
- Description: The Agoraphilic algorithm is an optimistic approach to reactive path planning for mobile robot platforms. The technique uses virtual, attractive forces derived from the surrounding free space. Fuzzy logic is utilised to limit the ‘free-space’ force so as to promote the movement towards the goal. The algorithm was designed to be a robust technique for reactive navigation that could be implemented without the fuss of tuning the sensitive parameters required for other classical navigation routines. Several simulations plus some preliminary experimental results are presented here to demonstrate the algorithm's potential.
Evaluating the Performances of the Agoraphilic Navigation Algorithm under Dead-Lock Situations
- Hewawasam, Hasitha, Ibrahim, Yousef, Kahandawa, Gayan, Choudhury, Tanveer
- Authors: Hewawasam, Hasitha , Ibrahim, Yousef , Kahandawa, Gayan , Choudhury, Tanveer
- Date: 2020
- Type: Text , Conference proceedings , Conference paper
- Relation: 29th IEEE International Symposium on Industrial Electronics, ISIE 2020 Vol. 2020-June, p. 536-542
- Full Text:
- Reviewed:
- Description: This paper presents a summary of the research which was conducted in developing a new free-space based (Agoraphilic) navigation algorithm. This new methodology is capable of maneuvering robots in static as well as dynamically cluttered unknown environments. The new algorithm uses only one force to drive the robot. This force is always an attractive force created by the freespace. This force is focused towards the goal by a force shaping module. Consequently, the robot is motivated to follow free-space directing towards the goal. As this method only based on the attractive forces, the robot always moves towards the goal as long as there is free-space . This method has eradicated many drawbacks of the traditional APF method. Several experimental tests were conducted using Turtlebot3 research platform. These tests were focused on testing the behavior of the new algorithm under dead-lock (local minima) situations for APF method. The test results proved that the proposed algorithm has successfully eliminated the local minima problem of APF method. © 2020 IEEE.
- Authors: Hewawasam, Hasitha , Ibrahim, Yousef , Kahandawa, Gayan , Choudhury, Tanveer
- Date: 2020
- Type: Text , Conference proceedings , Conference paper
- Relation: 29th IEEE International Symposium on Industrial Electronics, ISIE 2020 Vol. 2020-June, p. 536-542
- Full Text:
- Reviewed:
- Description: This paper presents a summary of the research which was conducted in developing a new free-space based (Agoraphilic) navigation algorithm. This new methodology is capable of maneuvering robots in static as well as dynamically cluttered unknown environments. The new algorithm uses only one force to drive the robot. This force is always an attractive force created by the freespace. This force is focused towards the goal by a force shaping module. Consequently, the robot is motivated to follow free-space directing towards the goal. As this method only based on the attractive forces, the robot always moves towards the goal as long as there is free-space . This method has eradicated many drawbacks of the traditional APF method. Several experimental tests were conducted using Turtlebot3 research platform. These tests were focused on testing the behavior of the new algorithm under dead-lock (local minima) situations for APF method. The test results proved that the proposed algorithm has successfully eliminated the local minima problem of APF method. © 2020 IEEE.
Position sensing of industrial robots-A survey
- Poplawski, Jaroslaw, Sultan, Ibrahim
- Authors: Poplawski, Jaroslaw , Sultan, Ibrahim
- Date: 2007
- Type: Text , Journal article
- Relation: Information Technology Journal Vol. 6, no. 1 (2007), p. 14-25
- Full Text:
- Reviewed:
- Description: This study offers a comprehensive coverage for many methods, systems and applications employed for robot positioning. The scope of material found reflects the width and breadth of what has been achieved in robot positioning and forms a basis for further research into possible new designs and applications. © 2007 Asian Network for Scientific Information.
- Description: C1
- Description: 2003004742
- Authors: Poplawski, Jaroslaw , Sultan, Ibrahim
- Date: 2007
- Type: Text , Journal article
- Relation: Information Technology Journal Vol. 6, no. 1 (2007), p. 14-25
- Full Text:
- Reviewed:
- Description: This study offers a comprehensive coverage for many methods, systems and applications employed for robot positioning. The scope of material found reflects the width and breadth of what has been achieved in robot positioning and forms a basis for further research into possible new designs and applications. © 2007 Asian Network for Scientific Information.
- Description: C1
- Description: 2003004742
Agoraphilic navigation algorithm in dynamic environment
- Authors: Hewawasam, Hasitha
- Date: 2021
- Type: Text , Thesis , PhD
- Full Text:
- Description: This thesis presents a novel Agoraphilic (free space attraction [FSA])-based navigation algorithm. This new algorithm is capable of undertaking local path planning for robot navigation in static and dynamic environments with the presence of a moving goal. The proposed algorithm eliminates the common weaknesses of the existing navigation approaches when operating in unknown dynamic environments while using the modified Agoraphilic concept. The Agoraphilic Navigation Algorithm in Dynamic Environment (ANADE) presented in this thesis does not look for obstacles (problems) to avoid; rather, it looks for free space (solutions) to follow. Therefore, this algorithm is also a human-like optimistic navigation algorithm. The proposed algorithm creates a set of Free Space Forces (FSFs) based on the current and future growing free space around the robot. These Free Space Forces are focused towards the current and future locations of a moving goal and finally generate a single attractive force. This attractive force pulls the robot through current free space towards the future growing free space leading to the goal. The new free space concept allows the ANADE to overcome many common problems of navigation algorithms. Several versions of the ANADE have been developed throughout this research to overcome the main limitation of the original Agoraphilic algorithm and address the common weaknesses of the existing navigation approaches. The ANADE I uses an object tracking method to identify the states (locations) of moving objects accurately. The ANADE II uses a dynamic obstacle prediction methodology to identify the robot’s future environments. In the ANADE III, a novel controller based on fuzzy logic was developed and combined with the new FSA concept to provide optimal navigational solutions at a low computational cost. In the ANADE III, the effectiveness of the ANADE II was further improved by incorporating the velocity vectors of the moving objects into decision-making. In the ANADE IV, a self-tuning system was successfully applied to the ANADE III to take advantage of the performances of free space attraction-based navigation algorithms. The proposed final version of the algorithm (ANADE V) comprises nine main modules. These modules are repeatedly used to create the robot’s driving force, which pulls the robot towards the goal (moving or static). An obstacle tracking module is used to identify the time-varying free spaces by tracking the moving objects. Further, a tracking system is also used to track the moving goal. The capacity of the ANADE was strengthened further by obstacle and goal path prediction modules. Future location prediction allowed the algorithm to make decisions by considering future environments around the robot. This is further supported by a self-tuning, machine learning–based controller designed to efficiently account for the inherent high uncertainties in the robot’s operational environment at a reduced computational cost. Experimental and simulation-based tests were conducted under dynamic environments to validate the algorithm. Further, the ANADE was benchmarked against other recently developed navigation algorithms. Those tests were focused on the behaviour of the algorithm under challenging environments with moving and static obstacles and goals. Further, the test results demonstrate that the ANADE is successful in navigating robots under unknown, dynamically cluttered environments.
- Description: Doctor of Philosophy
- Authors: Hewawasam, Hasitha
- Date: 2021
- Type: Text , Thesis , PhD
- Full Text:
- Description: This thesis presents a novel Agoraphilic (free space attraction [FSA])-based navigation algorithm. This new algorithm is capable of undertaking local path planning for robot navigation in static and dynamic environments with the presence of a moving goal. The proposed algorithm eliminates the common weaknesses of the existing navigation approaches when operating in unknown dynamic environments while using the modified Agoraphilic concept. The Agoraphilic Navigation Algorithm in Dynamic Environment (ANADE) presented in this thesis does not look for obstacles (problems) to avoid; rather, it looks for free space (solutions) to follow. Therefore, this algorithm is also a human-like optimistic navigation algorithm. The proposed algorithm creates a set of Free Space Forces (FSFs) based on the current and future growing free space around the robot. These Free Space Forces are focused towards the current and future locations of a moving goal and finally generate a single attractive force. This attractive force pulls the robot through current free space towards the future growing free space leading to the goal. The new free space concept allows the ANADE to overcome many common problems of navigation algorithms. Several versions of the ANADE have been developed throughout this research to overcome the main limitation of the original Agoraphilic algorithm and address the common weaknesses of the existing navigation approaches. The ANADE I uses an object tracking method to identify the states (locations) of moving objects accurately. The ANADE II uses a dynamic obstacle prediction methodology to identify the robot’s future environments. In the ANADE III, a novel controller based on fuzzy logic was developed and combined with the new FSA concept to provide optimal navigational solutions at a low computational cost. In the ANADE III, the effectiveness of the ANADE II was further improved by incorporating the velocity vectors of the moving objects into decision-making. In the ANADE IV, a self-tuning system was successfully applied to the ANADE III to take advantage of the performances of free space attraction-based navigation algorithms. The proposed final version of the algorithm (ANADE V) comprises nine main modules. These modules are repeatedly used to create the robot’s driving force, which pulls the robot towards the goal (moving or static). An obstacle tracking module is used to identify the time-varying free spaces by tracking the moving objects. Further, a tracking system is also used to track the moving goal. The capacity of the ANADE was strengthened further by obstacle and goal path prediction modules. Future location prediction allowed the algorithm to make decisions by considering future environments around the robot. This is further supported by a self-tuning, machine learning–based controller designed to efficiently account for the inherent high uncertainties in the robot’s operational environment at a reduced computational cost. Experimental and simulation-based tests were conducted under dynamic environments to validate the algorithm. Further, the ANADE was benchmarked against other recently developed navigation algorithms. Those tests were focused on the behaviour of the algorithm under challenging environments with moving and static obstacles and goals. Further, the test results demonstrate that the ANADE is successful in navigating robots under unknown, dynamically cluttered environments.
- Description: Doctor of Philosophy
Agoraphilic navigation algorithm under dynamic environment
- Hewawasam, Hasitha, Ibrahim, Yousef, Appuhamillage, Gayan, Choudhury, Tanveer
- Authors: Hewawasam, Hasitha , Ibrahim, Yousef , Appuhamillage, Gayan , Choudhury, Tanveer
- Date: 2022
- Type: Text , Journal article
- Relation: IEEE/ASME Transactions on Mechatronics Vol. 27, no. 3 (2022), p. 1727-1737
- Full Text: false
- Reviewed:
- Description: This article presents a summary of the work done on the development of a new algorithm for mobile robot navigation in unknown dynamic environment. The developed humanlike algorithm uses a free-space attraction (Agoraphilic) concept for robot navigation. The algorithm presented in this article is an advanced development of the Agoraphilic navigation algorithm. The Agoraphilic algorithm does not look for obstacles (problems) to avoid but rather for free spaces toward the goal (solutions) to follow. The original Agoraphilic while it was able to overcome the limitations of the traditional algorithms had its own limitations in navigating robots in environments cluttered with moving obstacles. The new Agoraphilic Navigation Algorithm under Dynamic Environment (ANADE) was developed to overcome those limitations. ANADE consists of seven main modules reported in this article. The objects tracking and objects prediction methodologies developed for the algorithm estimate future growing free-space passages toward the goal. The algorithm generates a time-varying single attractive force to pull the robot through the free space toward the predicted (future) growing free-space passages leading to the goal. The new algorithm was tested, not only through simulation, but also through experimental work. Summary of the experimental results is presented and discussed in this article. © 1996-2012 IEEE.
Past, present and future of path-planning algorithms for mobile robot navigation in dynamic environments
- Hewawasam, H. S., Ibrahim, M. Y., Appuhamillage, G. K.
- Authors: Hewawasam, H. S. , Ibrahim, M. Y. , Appuhamillage, G. K.
- Date: 2022
- Type: Text , Journal article
- Relation: IEEE Open Journal of the Industrial Electronics Society Vol. 3, no. (2022), p. 353-365
- Full Text:
- Reviewed:
- Description: Mobile robots have been making a significant contribution to the advancement of many sectors including automation of mining, space, surveillance, military, health, agriculture and many more. Safe and efficient navigation is a fundamental requirement of mobile robots, thus, the demand for advanced algorithms rapidly increased. Mobile robot navigation encompasses the following four requirements: perception, localization, path-planning and motion control. Among those, path-planning is a vital part of a fast, secure operation. During the last couple of decades, many path-planning algorithms were developed. Despite most of the mobile robot applications being in dynamic environments, the number of algorithms capable of navigating robots in dynamic environments is limited. This paper presents a qualitative comparative study of the up-to-date mobile robot path-planning methods capable of navigating robots in dynamic environments. The paper discusses both classical and heuristic methods including artificial potential field, genetic algorithm, fuzzy logic, neural networks, artificial bee colony, particle swarm optimization, bacterial foraging optimization, ant-colony and Agoraphilic algorithm. The general advantages and disadvantages of each method are discussed. Furthermore, the commonly used state-of-the-art methods are critically analyzed based on six performance criteria: algorithm's ability to navigate in dynamically cluttered areas, moving goal hunting ability, object tracking ability, object path prediction ability, incorporating the obstacle velocity in the decision, validation by simulation and experimentation. This investigation benefits researchers in choosing suitable path-planning methods for different applications as well as identifying gaps in this field. © 2020 IEEE.
- Authors: Hewawasam, H. S. , Ibrahim, M. Y. , Appuhamillage, G. K.
- Date: 2022
- Type: Text , Journal article
- Relation: IEEE Open Journal of the Industrial Electronics Society Vol. 3, no. (2022), p. 353-365
- Full Text:
- Reviewed:
- Description: Mobile robots have been making a significant contribution to the advancement of many sectors including automation of mining, space, surveillance, military, health, agriculture and many more. Safe and efficient navigation is a fundamental requirement of mobile robots, thus, the demand for advanced algorithms rapidly increased. Mobile robot navigation encompasses the following four requirements: perception, localization, path-planning and motion control. Among those, path-planning is a vital part of a fast, secure operation. During the last couple of decades, many path-planning algorithms were developed. Despite most of the mobile robot applications being in dynamic environments, the number of algorithms capable of navigating robots in dynamic environments is limited. This paper presents a qualitative comparative study of the up-to-date mobile robot path-planning methods capable of navigating robots in dynamic environments. The paper discusses both classical and heuristic methods including artificial potential field, genetic algorithm, fuzzy logic, neural networks, artificial bee colony, particle swarm optimization, bacterial foraging optimization, ant-colony and Agoraphilic algorithm. The general advantages and disadvantages of each method are discussed. Furthermore, the commonly used state-of-the-art methods are critically analyzed based on six performance criteria: algorithm's ability to navigate in dynamically cluttered areas, moving goal hunting ability, object tracking ability, object path prediction ability, incorporating the obstacle velocity in the decision, validation by simulation and experimentation. This investigation benefits researchers in choosing suitable path-planning methods for different applications as well as identifying gaps in this field. © 2020 IEEE.
Machine learning-based agoraphilic navigation algorithm
- Hewawasam, Hasitha, Ibrahim, Yousef, Kahandawa, Gayan
- Authors: Hewawasam, Hasitha , Ibrahim, Yousef , Kahandawa, Gayan
- Date: 2022
- Type: Text , Conference paper
- Relation: 48th Annual Conference of the IEEE Industrial Electronics Society, IECON 2022, Brussels, 17-20 October 2022, Proceedings IECON 2022 – 48th Annual Conference of the IEEE Industrial Electronics Society Vol. 2022-October
- Full Text: false
- Reviewed:
- Description: This paper presents a novel machine learning-based Agoraphilic (free space attraction) navigation algorithm. The proposed algorithm is capable of undertaking local path planning for mobile robots in unknown dynamic environments with a moving goal. The inability to track and reach a moving goal is one of the common weaknesses of most existing navigation algorithms operating in dynamic environments. High uncertainty involved in dynamic environments is also another major challenge. The novel machine learning-based approach helps the proposed algorithm to successfully overcome these challenges. This paper also introduces the integrated modular-based architecture for free-space attraction-based algorithms. This allows the algorithm to incorporate ten different modules with miscellaneous algorithms to perform sub-tasks such as tracking, prediction, map generation, machine learning-based free space attraction force generation and robot motion command generation. The new modular-based architecture integrates those sub-modules to create the robot's driving force. This driving force is the single attractive force to pull the robot towards the moving goal via current free space leading to future free space passages. The proposed algorithm was experimentally tested under a dynamic environment. The experiment was focused on testing the behaviour of the algorithm under the challenge of reaching a moving goal. Furthermore, the test results demonstrate that the Agoraphilic algorithm is successful in reaching a moving goal in an unknown dynamically cluttered environment. © 2022 IEEE.
A novel optimistic local path planner : agoraphilic navigation algorithm in dynamic environment
- Hewawasam, Hasitha, Ibrahim, Yousef, Kahandawa, Gayan
- Authors: Hewawasam, Hasitha , Ibrahim, Yousef , Kahandawa, Gayan
- Date: 2022
- Type: Text , Journal article
- Relation: Machines Vol. 10, no. 11 (2022), p.
- Full Text:
- Reviewed:
- Description: This paper presents a novel local path planning algorithm developed based on the new free space attraction (Agoraphilic) concept. The proposed algorithm is capable of navigating robots in unknown static, as well as dynamically cluttered environments. Unlike the other navigation algorithms, the proposed algorithm takes the optimistic approach of the navigation problem. It does not look for problems to avoid, but rather for solutions to follow. This human-like decision-making behaviour distinguishes the new algorithm from all the other navigation algorithms. Furthermore, the new algorithm utilises newly developed tracking and prediction algorithms, to safely navigate mobile robots. This is further supported by a fuzzy logic controller designed to efficiently account for the inherent high uncertainties in the robot’s operational environment at a reduced computational cost. This paper also includes physical experimental results combined with bench-marking against other recent methods. The reported results verify the algorithm’s successful advantages in navigating robots in both static and dynamic environments. © 2022 by the authors.
- Authors: Hewawasam, Hasitha , Ibrahim, Yousef , Kahandawa, Gayan
- Date: 2022
- Type: Text , Journal article
- Relation: Machines Vol. 10, no. 11 (2022), p.
- Full Text:
- Reviewed:
- Description: This paper presents a novel local path planning algorithm developed based on the new free space attraction (Agoraphilic) concept. The proposed algorithm is capable of navigating robots in unknown static, as well as dynamically cluttered environments. Unlike the other navigation algorithms, the proposed algorithm takes the optimistic approach of the navigation problem. It does not look for problems to avoid, but rather for solutions to follow. This human-like decision-making behaviour distinguishes the new algorithm from all the other navigation algorithms. Furthermore, the new algorithm utilises newly developed tracking and prediction algorithms, to safely navigate mobile robots. This is further supported by a fuzzy logic controller designed to efficiently account for the inherent high uncertainties in the robot’s operational environment at a reduced computational cost. This paper also includes physical experimental results combined with bench-marking against other recent methods. The reported results verify the algorithm’s successful advantages in navigating robots in both static and dynamic environments. © 2022 by the authors.
The experience of structural burden for culturally and linguistically diverse family carers of people living with dementia in Australia
- Gilbert, Andrew, Antoniades, Josefine, Croy, Samantha, Thodis, Antonia, Adams, Jon, Goeman, Dianne, Browning, Colette, Kent, Mike, Ellis, Katie, Brijnath, Bianca
- Authors: Gilbert, Andrew , Antoniades, Josefine , Croy, Samantha , Thodis, Antonia , Adams, Jon , Goeman, Dianne , Browning, Colette , Kent, Mike , Ellis, Katie , Brijnath, Bianca
- Date: 2022
- Type: Text , Journal article
- Relation: Health and Social Care in the community Vol. 30, no. 6 (2022), p. e4492-e4503
- Full Text:
- Reviewed:
- Description: Evidence suggests that family carers of culturally and linguistically diverse (CALD) people living with dementia experience higher stress and unmet need than the general Australian population. These disparities are often framed as the result of CALD communities failing to seek formal support. Challenging this, we draw on the concept of ‘structural burden’ to explore how the complexity of health and aged systems contribute to the burden that CALD carers experience. We conducted semi‐structured interviews with 104 family carers for CALD people with dementia in Australia, followed by thematic analysis of transcripts. Additional to structural burdens encountered by the general older population, CALD carers faced challenges understanding Australia's Anglo‐centric aged care system, locating culturally appropriate care and were required to translate the languages and operations of health and aged care systems into terms their family members understood. This burden was mitigated by the presence of ethno‐specific organisations and other navigation support. Australia's aged care system has moved towards centralised governance and consumer‐directed care provision. This system involves a confusing array of different programmes and levels, bureaucratic applications and long waiting times. Carers' encounters with these systems demonstrates how some CALD people are being left behind by the current aged care system. While ethno‐specific services can reduce this burden, not all CALD groups are represented. Consequently, improving access to dementia care among CALD populations requires entry point and navigation support that is culturally appropriate and linguistically accessible.
- Authors: Gilbert, Andrew , Antoniades, Josefine , Croy, Samantha , Thodis, Antonia , Adams, Jon , Goeman, Dianne , Browning, Colette , Kent, Mike , Ellis, Katie , Brijnath, Bianca
- Date: 2022
- Type: Text , Journal article
- Relation: Health and Social Care in the community Vol. 30, no. 6 (2022), p. e4492-e4503
- Full Text:
- Reviewed:
- Description: Evidence suggests that family carers of culturally and linguistically diverse (CALD) people living with dementia experience higher stress and unmet need than the general Australian population. These disparities are often framed as the result of CALD communities failing to seek formal support. Challenging this, we draw on the concept of ‘structural burden’ to explore how the complexity of health and aged systems contribute to the burden that CALD carers experience. We conducted semi‐structured interviews with 104 family carers for CALD people with dementia in Australia, followed by thematic analysis of transcripts. Additional to structural burdens encountered by the general older population, CALD carers faced challenges understanding Australia's Anglo‐centric aged care system, locating culturally appropriate care and were required to translate the languages and operations of health and aged care systems into terms their family members understood. This burden was mitigated by the presence of ethno‐specific organisations and other navigation support. Australia's aged care system has moved towards centralised governance and consumer‐directed care provision. This system involves a confusing array of different programmes and levels, bureaucratic applications and long waiting times. Carers' encounters with these systems demonstrates how some CALD people are being left behind by the current aged care system. While ethno‐specific services can reduce this burden, not all CALD groups are represented. Consequently, improving access to dementia care among CALD populations requires entry point and navigation support that is culturally appropriate and linguistically accessible.
Machine learning-based agoraphilic navigation algorithm for use in dynamic environments with a moving goal
- Hewawasam, Hasitha, Kahandawa, Gayan, Ibrahim, Yousef
- Authors: Hewawasam, Hasitha , Kahandawa, Gayan , Ibrahim, Yousef
- Date: 2023
- Type: Text , Journal article
- Relation: Machines Vol. 11, no. 5 (2023), p. 513
- Full Text:
- Reviewed:
- Description: This paper presents a novel development of a new machine learning-based control system for the Agoraphilic (free-space attraction) concept of navigating robots in unknown dynamic environments with a moving goal. Furthermore, this paper presents a new methodology to generate training and testing datasets to develop a machine learning-based module to improve the performances of Agoraphilic algorithms. The new algorithm presented in this paper utilises the free-space attraction (Agoraphilic) concept to safely navigate a mobile robot in a dynamically cluttered environment with a moving goal. The algorithm uses tracking and prediction strategies to estimate the position and velocity vectors of detected moving obstacles and the goal. This predictive methodology enables the algorithm to identify and incorporate potential future growing free-space passages towards the moving goal. This is supported by the new machine learning-based controller designed specifically to efficiently account for the high uncertainties inherent in the robot’s operational environment with a moving goal at a reduced computational cost. This paper also includes comparative and experimental results to demonstrate the improvements of the algorithm after introducing the machine learning technique. The presented experiments demonstrated the success of the algorithm in navigating robots in dynamic environments with the challenge of a moving goal.
- Authors: Hewawasam, Hasitha , Kahandawa, Gayan , Ibrahim, Yousef
- Date: 2023
- Type: Text , Journal article
- Relation: Machines Vol. 11, no. 5 (2023), p. 513
- Full Text:
- Reviewed:
- Description: This paper presents a novel development of a new machine learning-based control system for the Agoraphilic (free-space attraction) concept of navigating robots in unknown dynamic environments with a moving goal. Furthermore, this paper presents a new methodology to generate training and testing datasets to develop a machine learning-based module to improve the performances of Agoraphilic algorithms. The new algorithm presented in this paper utilises the free-space attraction (Agoraphilic) concept to safely navigate a mobile robot in a dynamically cluttered environment with a moving goal. The algorithm uses tracking and prediction strategies to estimate the position and velocity vectors of detected moving obstacles and the goal. This predictive methodology enables the algorithm to identify and incorporate potential future growing free-space passages towards the moving goal. This is supported by the new machine learning-based controller designed specifically to efficiently account for the high uncertainties inherent in the robot’s operational environment with a moving goal at a reduced computational cost. This paper also includes comparative and experimental results to demonstrate the improvements of the algorithm after introducing the machine learning technique. The presented experiments demonstrated the success of the algorithm in navigating robots in dynamic environments with the challenge of a moving goal.
- «
- ‹
- 1
- ›
- »