Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (4)

Search Parameters:
Keywords = sTetro

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
29 pages, 4936 KB  
Article
Deep Learning Based Fall Recognition and Forecasting for Reconfigurable Stair-Accessing Service Robots
by Jun Hua Ong, Abdullah Aamir Hayat, Braulio Felix Gomez, Mohan Rajesh Elara and Kristin Lee Wood
Mathematics 2024, 12(9), 1312; https://doi.org/10.3390/math12091312 - 25 Apr 2024
Cited by 4 | Viewed by 2644
Abstract
This paper presents a comprehensive study on fall recognition and forecasting for reconfigurable stair-accessing robots by leveraging deep learning techniques. The proposed framework integrates machine learning algorithms and recurrent neural networks (RNNs), specifically Long Short-Term Memory (LSTM) and Bidirectional LSTM (BiLSTM), for fall [...] Read more.
This paper presents a comprehensive study on fall recognition and forecasting for reconfigurable stair-accessing robots by leveraging deep learning techniques. The proposed framework integrates machine learning algorithms and recurrent neural networks (RNNs), specifically Long Short-Term Memory (LSTM) and Bidirectional LSTM (BiLSTM), for fall detection of service robots on staircases. The reconfigurable stair-accessing robot sTetro serves as the platform, and the fall data required for training models are generated in a simulation environment. The two machine learning algorithms are compared and their effectiveness on the fall recognition task is reported. The results indicate that the BiLSTM model effectively classifies falls with a median categorical accuracy of 94.10% in simulation and 90.02% with limited experiments. Additionally, the BiLSTM model can be used for forecasting, which is practically valuable for making decisions well before the onset of a free fall. This study contributes insights into the design and implementation of fall detection systems for service robots used to navigate staircases through deep learning approaches. Our experimental and simulation data, along with the simulation steps, are available for reference and analysis via the shared link. Full article
Show Figures

Figure 1

17 pages, 15591 KB  
Article
sTetro-Deep Learning Powered Staircase Cleaning and Maintenance Reconfigurable Robot
by Balakrishnan Ramalingam, Rajesh Elara Mohan, Selvasundari Balakrishnan, Karthikeyan Elangovan, Braulio Félix Gómez, Thejus Pathmakumar, Manojkumar Devarassu, Madan Mohan Rayaguru and Chanthini Baskar
Sensors 2021, 21(18), 6279; https://doi.org/10.3390/s21186279 - 18 Sep 2021
Cited by 20 | Viewed by 6064
Abstract
Staircase cleaning is a crucial and time-consuming task for maintenance of multistory apartments and commercial buildings. There are many commercially available autonomous cleaning robots in the market for building maintenance, but few of them are designed for staircase cleaning. A key challenge for [...] Read more.
Staircase cleaning is a crucial and time-consuming task for maintenance of multistory apartments and commercial buildings. There are many commercially available autonomous cleaning robots in the market for building maintenance, but few of them are designed for staircase cleaning. A key challenge for automating staircase cleaning robots involves the design of Environmental Perception Systems (EPS), which assist the robot in determining and navigating staircases. This system also recognizes obstacles and debris for safe navigation and efficient cleaning while climbing the staircase. This work proposes an operational framework leveraging the vision based EPS for the modular re-configurable maintenance robot, called sTetro. The proposed system uses an SSD MobileNet real-time object detection model to recognize staircases, obstacles and debris. Furthermore, the model filters out false detection of staircases by fusion of depth information through the use of a MobileNet and SVM. The system uses a contour detection algorithm to localize the first step of the staircase and depth clustering scheme for obstacle and debris localization. The framework has been deployed on the sTetro robot using the Jetson Nano hardware from NVIDIA and tested with multistory staircases. The experimental results show that the entire framework takes an average of 310 ms to run and achieves an accuracy of 94.32% for staircase recognition tasks and 93.81% accuracy for obstacle and debris detection tasks during real operation of the robot. Full article
(This article belongs to the Section Sensors and Robotics)
Show Figures

Figure 1

23 pages, 12233 KB  
Article
Realization Energy Optimization of Complete Path Planning in Differential Drive Based Self-Reconfigurable Floor Cleaning Robot
by Anh Vu Le, Ping-Cheng Ku, Thein Than Tun, Nguyen Huu Khanh Nhan, Yuyao Shi and Rajesh Elara Mohan
Energies 2019, 12(6), 1136; https://doi.org/10.3390/en12061136 - 23 Mar 2019
Cited by 40 | Viewed by 5489
Abstract
The efficiency of energy usage applied to robots that implement autonomous duties such as floor cleaning depends crucially on the adopted path planning strategies. Energy-aware for complete coverage path planning (CCPP) in the reconfigurable robots raises interesting research, since the ability to change [...] Read more.
The efficiency of energy usage applied to robots that implement autonomous duties such as floor cleaning depends crucially on the adopted path planning strategies. Energy-aware for complete coverage path planning (CCPP) in the reconfigurable robots raises interesting research, since the ability to change the robot’s shape needs the dynamic estimate energy model. In this paper, a CCPP for a predefined workspace by a new floor cleaning platform (hTetro) which can self-reconfigure among seven tetromino shape by the cooperation of hinge-based four blocks with independent differential drive modules is proposed. To this end, the energy consumption is represented by travel distances which consider operations of differential drive modules of the hTetro kinematic designs to fulfill the transformation, orientation correction and translation actions during robot navigation processes from source waypoint to destination waypoint. The optimal trajectory connecting all pairs of waypoints on the workspace is modeled and solved by evolutionary algorithms of TSP such as Genetic Algorithm (GA) and Ant Optimization Colony (AC) which are among the well-known optimization approaches of TSP. The evaluations across several conventional complete coverage algorithms to prove that TSP-based proposed method is a practical energy-aware navigation sequencing strategy that can be implemented to our hTetro robot in different real-time workspaces. Moreover, The CCPP framework with its modulation in this paper allows the convenient implementation on other polynomial-based reconfigurable robots. Full article
Show Figures

Figure 1

21 pages, 3054 KB  
Article
Complete Path Planning for a Tetris-Inspired Self-Reconfigurable Robot by the Genetic Algorithm of the Traveling Salesman Problem
by Anh Vu Le, Manimuthu Arunmozhi, Prabakaran Veerajagadheswar, Ping-Cheng Ku, Tran Hoang Quang Minh, Vinu Sivanantham and Rajesh Elara Mohan
Electronics 2018, 7(12), 344; https://doi.org/10.3390/electronics7120344 - 22 Nov 2018
Cited by 44 | Viewed by 8005
Abstract
The efficiency of autonomous systems that tackle tasks such as home cleaning, agriculture harvesting, and mineral mining depends heavily on the adopted area coverage strategy. Extensive navigation strategies have been studied and developed, but few focus on scenarios with reconfigurable robot agents. This [...] Read more.
The efficiency of autonomous systems that tackle tasks such as home cleaning, agriculture harvesting, and mineral mining depends heavily on the adopted area coverage strategy. Extensive navigation strategies have been studied and developed, but few focus on scenarios with reconfigurable robot agents. This paper proposes a navigation strategy that accomplishes complete path planning for a Tetris-inspired hinge-based self-reconfigurable robot (hTetro), which consists of two main phases. In the first phase, polyomino form-based tilesets are generated to cover the predefined area based on the tiling theory, which generates a series of unsequenced waypoints that guarantee complete coverage of the entire workspace. Each waypoint specifies the position of the robot and the robot morphology on the map. In the second phase, an energy consumption evaluation model is constructed in order to determine a valid strategy to generate the sequence of the waypoints. The cost value between waypoints is formulated under the consideration of the hTetro robot platform’s kinematic design, where we calculate the minimum sum of displacement of the four blocks in the hTetro robot. With the cost function determined, the waypoint sequencing problem is then formulated as a travelling salesman problem (TSP). In this paper, a genetic algorithm (GA) is proposed as a strong candidate to solve the TSP. The GA produces a viable navigation sequence for the hTetro robot to follow and to accomplish complete coverage tasks. We performed an analysis across several complete coverage algorithms including zigzag, spiral, and greedy search to demonstrate that TSP with GA is a valid and considerably consistent waypoint sequencing strategy that can be implemented in real-world hTetro robot navigations. The scalability of the proposed framework allows the algorithm to produce reliable results while navigating within larger workspaces in the real world, and the flexibility of the framework ensures easy implementation of the algorithm on other polynomial-based shape shifting robots. Full article
(This article belongs to the Special Issue Motion Planning and Control for Robotics)
Show Figures

Graphical abstract

Back to TopTop