We present a data structure which represents a wellshaped convex tetrahedral mesh, M, in linear space such that path traversals visiting a sequence of K tetrahedra require O (K/ lgB) I/O operations in the external memory model. As applications of our structure we show how to efficiently perform axis parallel box queries and how to report the intersection of M with an arbitrarily oriented plane.

Turning back after engine failure during the take off phase of flight in a single engine aircraft is examined using a simplified analytical model. The important parameters are identified. The analysis shows that the optimum flight path is teardrop shaped with a 45◦ bank angle at stall velocity during the turn. The effects of engine failure altitude, wind direction and velocity, and bank angle o...

Autonomous vehicles require optimal path planning algorithms to achieve mission goals while avoiding obstacles and being robust to uncertainties. The uncertainties arise from exogenous disturbances, modeling errors, and sensor noise, which can be characterized via stochastic models. Previous work defined a notion of robustness in a stochastic setting by using the concept of chance constraints. ...

Reliable source to sink communication is the most important factor for an efficient routing protocol especially in domains of military, healthcare and disaster recovery applications. We present weighted energy aware multipath reliable routing (WEAMR), a novel energy aware multipath routing protocol which utilizes hotline-assisted routing to meet such requirements for mission critical applicatio...

We describe a practical path-planning algorithm that generates smooth paths for an autonomous vehicle operating in an unknown environment, where obstacles are detected online by the robot’s sensors. This work was motivated by and experimentally validated in the 2007 DARPA Urban Challenge, where robotic vehicles had to autonomously navigate parking lots. Our approach has two main steps. The firs...

We study the optimum transmission scheme that maximizes ergodic capacity of a 2×1 multiple-input single-output (MISO) system, when the channel knowledge at the transmitter is characterized by a known gain ratio and a known probability density function of the phase shift between antennas. Such a channel scenario can arise in a forward link at the base station when there is a single direct path p...

Echo state network contains a randomly connected hidden layer and an adaptable output layer. It can overcome the problems associated with the complex computation and local optima. But there may be ill-posed problem when large reservoir state matrix is used to calculate the output weights by least square estimation. In this study, we use L1/2 regularization to calculate the output weights to get...

19 In general, pattern recognition techniques require a high computational burden for learning the discriminating functions that are responsible to separate samples from distinct classes. As such, there are several studies that make effort to employ machine learning algorithms in the context of “big data” classification problems. The research on this area ranges from Graphics Processing Units-b...

We investigate the optimum reachability problem for MultiPriced Timed Automata (MPTA) that admit both positive and negative costs on edges and locations, thus bridging the gap between the results of Bouyer et al. (2007) and of Larsen and Rasmussen (2008). Our contributions are the following: (1) We show that even the location reachability problem is undecidable for MPTA equipped with both posit...