Robust predictive control of non-linear systems under state estimation errors and input and state constraints is a challenging problem, and solutions to it have generally involved solving computationally hard non-linear optimizations. Feedback linearization has reduced the computational burden, but has not yet been solved for robust model predictive control under estimation errors and constrain...

Hermitian codes belong to a powerful class of algebraic geometry codes, which allow to correct many independent errors. We show that Hermitian codes can correct many bursts of errors as well. Decoding of a Hermitian (N,K) code over q2 can be reduced to decoding of interleaved extended Reed-Solomon codes. Using this fact, we propose an efficient unique decoding algorithm correcting up to (N −K)/...

This paper focuses on Direct Policy Search (DPS) for cooperative path planning of a single beacon vehicle supporting Autonomous Underwater Vehicles (AUVs) performing surveying missions. Due to lack of availability of GPS signals underwater, the position errors of the AUVs grow with time even though they are equipped with proprioceptive sensors for dead reckoning. One way to minimize this error ...

The McEliece cryptosystem is a promising candidate for post-quantum public-key encryption. In this work, we propose q-ary codes over Gaussian integers the system and new channel model. With one Mannheim error channel, errors are limited to weight one. We investigate capacity of discuss its relation system. proposed based on simple product code construction have low complexity decoding algorithm...

A (t,u)threshold public key encryption (TPKE) is a public key encryption where a private key is splitted among u decryption servers (insiders) and at least t decryption servers (insiders) are required to decrypt the ciphertext but no group of t− 1 or less malicious insiders can decrypt the message. Bendlin and Damgard [1] presented first lattice based threshold public key encryption scheme base...

In this paper, we start research into using intervals to bound the impact of bounded measurement errors on the computation of bounds on finite population parameters (“descriptive statistics”). Specifically, we provide a feasible (quadratic time) algorithm for computing the lower bound σ on the finite population variance function of interval data. We prove that the problem of computing the upper...

In this paper, we present a solution to the extreme similarity sequencing problem. The extreme similarity sequencing problem consists of finding occurrences of a pattern p in a set S(0), S(1), …, S(k), of sequences of equal length, where S(i), for all 1≤i≤k, differs from S(0) by a constant number of errors - around 10 in practice. We present an asymptotically fast O(n + occ logocc) time algorit...

Safety guarantee prior to the deployment of robots can be difficult due unexpected disturbances in runtime. This article presents a real-time receding-horizon robust trajectory planning algorithm for nonlinear closed-loop systems, which guarantees safety system under unknown but bounded disturbances. We characterize forward reachable sets (FRSs) based on Hamilton–Jacobi reachability analysis as...

In this paper, the effects of two different Particle Size Distributions (PSD) on packingbehavior of ideal rigid spherical nanoparticles using a novel packing model based on parallelalgorithms have been reported. A mersenne twister algorithm was used to generate pseudorandomnumbers for the particles initial coordinates. Also, for this purpose a nanosized tetragonal confinedcontainer with a squar...