In this paper, we address the challenge of ensuring stability in bipedal walking robots and exoskeletons. We explore the feasibility of real-time implementation for the Predicted Step Viability algorithm (PSV), a complex multi-step optimization criterion for planning future steps in bipedal gait. To overcome the high computational cost of the PSV algorithm, we performed an analysis using 11 classification algorithms and a stacking strategy to predict if a step will be stable or not. We generated three datasets of increasing complexity through PSV simulations to evaluate the classification performance. Among the classifiers, k Nearest Neighbors, Support Vector Machine with Radial Basis Function Kernel, Decision Tree, and Random Forest exhibited superior performance. Multi-Layer Perceptron also consistently performed well, while linear-based algorithms showed lower performance. Importantly, the use of stacking did not significantly improve performance. Our results suggest that the feature vector applied with this approach is applicable across various robotic models and datasets, provided that training data is balanced and sufficient points are used. Notably, by leveraging classifiers, we achieved rapid computation of results in less than 1 ms, with minimal computational cost.

The prediction of the stability of future steps taken by a biped robot is a very important task, since it allows the robot controller to adopt the necessary measures in order to minimize damages if a fall is predicted. We present a classifier to predict the viability of a given planned step taken by a biped robot, i.e., if it will be stable or unstable. The features of the classifier are extracted from a feature engineering process exploiting the useful information contained in the time series generated in the trajectory planning of the step. In order to state the problem as a supervised classification one, we need the ground truth class for each planned step. This is obtained using the Predicted Step Viability (PSV) criterion. We also present a procedure to obtain a balanced and challenging training/testing dataset of planned steps that contains many steps in the border between stable and non stable regions. Following this trajectory planning strategy for the creation of the dataset we are able to improve the robustness of the classifier. Results show that the classifier is able to obtain a 95% of ROC AUC for this demanding dataset using only four time series among all the signals required by PSV to check viability. This allows to replace the PSV stability criterion, which is safe, robust but impossible to apply in real-time, by a simple, fast and embeddable classifier that can run in real time consuming much less resources than the PSV.