Biped Gait Stability Classification Based on the Predicted Step Viability

Abstract

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.

Keywords

• biped stability
• classification
• real-time application
• predicted step viability