2 resultados para collision avoidance
em CaltechTHESIS
Resumo:
This thesis explores the problem of mobile robot navigation in dense human crowds. We begin by considering a fundamental impediment to classical motion planning algorithms called the freezing robot problem: once the environment surpasses a certain level of complexity, the planner decides that all forward paths are unsafe, and the robot freezes in place (or performs unnecessary maneuvers) to avoid collisions. Since a feasible path typically exists, this behavior is suboptimal. Existing approaches have focused on reducing predictive uncertainty by employing higher fidelity individual dynamics models or heuristically limiting the individual predictive covariance to prevent overcautious navigation. We demonstrate that both the individual prediction and the individual predictive uncertainty have little to do with this undesirable navigation behavior. Additionally, we provide evidence that dynamic agents are able to navigate in dense crowds by engaging in joint collision avoidance, cooperatively making room to create feasible trajectories. We accordingly develop interacting Gaussian processes, a prediction density that captures cooperative collision avoidance, and a "multiple goal" extension that models the goal driven nature of human decision making. Navigation naturally emerges as a statistic of this distribution.
Most importantly, we empirically validate our models in the Chandler dining hall at Caltech during peak hours, and in the process, carry out the first extensive quantitative study of robot navigation in dense human crowds (collecting data on 488 runs). The multiple goal interacting Gaussian processes algorithm performs comparably with human teleoperators in crowd densities nearing 1 person/m2, while a state of the art noncooperative planner exhibits unsafe behavior more than 3 times as often as the multiple goal extension, and twice as often as the basic interacting Gaussian process approach. Furthermore, a reactive planner based on the widely used dynamic window approach proves insufficient for crowd densities above 0.55 people/m2. We also show that our noncooperative planner or our reactive planner capture the salient characteristics of nearly any dynamic navigation algorithm. For inclusive validation purposes, we show that either our non-interacting planner or our reactive planner captures the salient characteristics of nearly any existing dynamic navigation algorithm. Based on these experimental results and theoretical observations, we conclude that a cooperation model is critical for safe and efficient robot navigation in dense human crowds.
Finally, we produce a large database of ground truth pedestrian crowd data. We make this ground truth database publicly available for further scientific study of crowd prediction models, learning from demonstration algorithms, and human robot interaction models in general.
Resumo:
This dissertation consists of three parts. In Part I, it is shown that looping trajectories cannot exist in finite amplitude stationary hydromagnetic waves propagating across a magnetic field in a quasi-neutral cold collision-free plasma. In Part II, time-dependent solutions in series expansion are presented for the magnetic piston problem, which describes waves propagating into a quasi-neutral cold collision-free plasma, ensuing from magnetic disturbances on the boundary of the plasma. The expansion is equivalent to Picard's successive approximations. It is then shown that orbit crossings of plasma particles occur on the boundary for strong disturbances and inside the plasma for weak disturbances. In Part III, the existence of periodic waves propagating at an arbitrary angle to the magnetic field in a plasma is demonstrated by Stokes expansions in amplitude. Then stability analysis is made for such periodic waves with respect to side-band frequency disturbances. It is shown that waves of slow mode are unstable whereas waves of fast mode are stable if the frequency is below the cutoff frequency. The cutoff frequency depends on the propagation angle. For longitudinal propagation the cutoff frequency is equal to one-fourth of the electron's gyrofrequency. For transverse propagation the cutoff frequency is so high that waves of all frequencies are stable.