The purpose of this dissertation is to address the problem of predicting pedestrian movement and behavior in and among crowds. Specifically, we will focus on an agent based approach where pedestrians are treated individually and parameters for an energy model are trained by real world video data. These learned pedestrian models are useful in applications such as tracking, simulation, and artificial intelligence. The applications of this method are explored and experimental results show that our trained pedestrian motion model is beneficial for predicting unseen or lost tracks as well as guiding appearance based tracking algorithms. The method we have developed for training such a pedestrian model operates by optimizing a set of weights governing an aggregate energy function in order to minimize a loss function computed between a model's prediction and annotated ground-truth pedestrian tracks. The formulation of the underlying energy function is such that using tight convex upper bounds, we are able to efficiently approximate the derivative of the loss function with respect to the parameters of the model. Once this is accomplished, the model parameters are updated using straightforward gradient descent techniques in order to achieve an optimal solution. This formulation also lends itself towards the development of a multiple behavior model. The multiple pedestrian behavior styles, informally referred to as "stereotypes", are common in real data. In our model we show that it is possible, due to the unique ability to compute the derivative of the loss function, to build a new model which utilizes a soft-minimization of single behavior models. This allows unsupervised training of multiple different behavior models in parallel. This novel extension makes our method unique among other methods in the attempt to accurately describe human pedestrian behavior for the myriad of applications that exist. The ability to describe multiple behaviors shows significant improvements in the task of pedestrian motion prediction.

No description available.

Repetitive control (RC) was proven to enable high performance for systems that are subject to periodically repeating signals by enhancing an existing feedback control system so that it produces zero tracking error to a periodic command, or zero tracking error in the presence of a periodic disturbance of known period. Periodic signals are very common in many applications like robotics, disk drive systems, power converters, photolithography, jitter or vibration elimination in spacecraft and many more. Due to the growth in micro-processor and micro-controller technologies, most of the controllers are implemented in digital domain. Digital RC is typically designed by assuming a known constant period of command/disturbance signal, which then leads to the selection of a fixed sampling period that keeps it synchronized with the command/disturbance signal. However, in practice, the period for these signals might not be accurately known or might vary with time. In order to overcome this problem, higher order RC (HORC) was proposed as one method to make RC less sensitive to period error or period fluctuations. This dissertation investigates HORC, specifically second and third order RC designs (SORC and TORC), to identify the limitations, gaps, and design tradeoffs that a control system designer faces. New designs and methods are developed to address such gaps including stability, designer tradeoffs, robustness and other related performance characteristics. This dissertation has three major parts: SORC designs and stability, SORC design tradeoffs, and TORC designs and stability.

Iterative Learning Control (ILC) considers systems which perform the given desired trajectory repetitively. The command for the upcoming iteration is updated after every iteration based on the previous recorded error, aiming to converge to zero error in the real-world. Iterative Learning Control can be considered as an inverse problem, solving for the needed input that produces the desired output. However, digital control systems need to convert differential equations to digital form. For a majority of real world systems this introduces one or more zeros of the system z-transfer function outside the unit circle making the inverse system unstable. The resulting control input that produces zero error at the sample times following the desired trajectory is unstable, growing exponentially in magnitude each time step. The tracking error between time steps is also growing exponentially defeating the intended objective of zero tracking error. One way to address the instability in the inverse of non-minimum phase systems is to use basis functions. Besides addressing the unstable inverse issue, using basis functions also has several other advantages. First, it significantly reduces the computation burden in solving for the input command, as the number of basis functions chosen is usually much smaller than the number of time steps in one iteration. Second, it allows the designer to choose the frequency to cut off the learning process, which provides stability robustness to unmodelled high frequency dynamics eliminating the need to otherwise include a low-pass filter. In addition, choosing basis functions intelligently can lead to fast convergence of the learning process. All these benefits come at the expense of no longer asking for zero tracking error, but only aiming to correct the tracking error in the span of the chosen basis functions. Two kinds of matched basis functions are presented in this dissertation, frequency-response based basis functions and singular vector basis functions, respectively. In addition, basis functions are developed to directly capture the system transients that result from initial conditions and hence are not associated with forcing functions. The newly developed transient basis functions are particularly helpful in reducing the level of tracking error and constraining the magnitude of input control when the desired trajectory does not have a smooth start-up, corresponding to a smooth transition from the system state before the initial time, and the system state immediately after time zero on the desired trajectory. Another topic that has been investigated is the error accumulation in the unaddressed part of the output space, the part not covered by the span of the output basis functions, under different model conditions. It has been both proved mathematically and validated by numerical experiments that the error in the unaddressed space will remain constant when using an error-free model, and the unaddressed error will demonstrate a process of accumulation and finally converge to a constant level in the presence of model error. The same phenomenon is shown to apply when using unmatched basis functions. There will be unaddressed error accumulation even in the absence of model error, suggesting that matched basis functions should be used whenever possible. Another way to address the often unstable nature of the inverse of non-minimum phase systems is to use the in-house developed stable inverse theory Longman JiLLL, which can also be incorporated into other control algorithms including One-Step Ahead Control and Indirect Adaptive Control in addition to Iterative Learning Control. Using this stable inverse theory, One-Step Ahead Control has been generalized to apply to systems whose discrete-time inverses are unstable. The generalized one-step ahead control can be viewed as a Model Predictive Control that achieves zero tracking error with a control input bounded by the actuator constraints. In situations where one feels not confident about the system model, adaptive control can be applied to update the model parameters while achieving zero tracking error.