In this paper, a new method is proposed to find a feasible energy-efficient path between an initial point and goal point on uneven terrain and then to optimally traverse the path. The path is planned by integrating the geometric features of the uneven terrain and the biped robot dynamics. This integrated information of biped dynamics and associated cost (energy) for moving toward the goal point is used to define the value of a new speed function at each point on the discretized surface of the terrain. The value is stored as a matrix called the dynamic transport cost (DTC). The path is obtained by solving the Eikonal equation numerically by fast marching method (FMM) on an orthogonal grid, by using the information stored in the DTC matrix. One step of walk on uneven terrain is characterized by 10 footstep parameters (FSPs); these FSPs represent the position of swinging foot at the starting and ending time of the walk, orientation, and state (left or right) of support foot. A walking dataset was created for different walking conditions (FSPs), which the biped robot is likely to encounter when it has to walk on the uneven terrain. The corresponding energy optimal hip and foot trajectory parameters (HFTPs) are obtained by optimization using a genetic algorithm (GA). The created walk dataset is generalized by training a feedforward neural network (NN) using the scaled conjugate gradient (SCG) algorithm. The Foot placement planner gives a sequence of foot positions and orientations along the obtained path, which is followed by the biped robot by generating real-time optimal foot and hip trajectories using the learned NN. Simulation results on different types of uneven terrains validate the proposed method.

Floor field methods are one of the most popular medium-scale navigation concepts in microscopic pedestrian simulators. Recently introduced dynamic floor field methods have significantly increased the realism of such simulations, i.e. agreement of spatio-temporal patterns of pedestrian densities in simulations with real world observations. These methods update floor fields continuously taking other pedestrians into account. This implies that computational times are mainly determined by the calculation of floor fields. In this work, we propose a new computational approach for the construction of dynamic floor fields. The approach is based on the one hand on adaptive grid concepts and on the other hand on a directed calculation of floor fields, i.e. the calculation is restricted to the domain of interest. Combining both techniques the computational complexity can be reduced by a factor of 10 as demonstrated by several realistic scenarios. Thus on-line simulations, a requirement of many applications, are possible for moderate realistic scenarios.