Total disconnectedness of Julia sets of random quadratic polynomials

For a sequence of complex parameters $(c_n)$ we consider the composition of functions $f_{c_n} (z) = z^2 + c_n$ , the non-autonomous version of the classical quadratic dynamical system. The definitions of Julia and Fatou sets are naturally generalized to this setting. We answer a question posed by Brück, Büger and Reitz, whether the Julia set for such a sequence is almost always totally disconnected, if the values $c_n$ are chosen randomly from a large disc. Our proof is easily generalized to answer a lot of other related questions regarding typical connectivity of the random Julia set. In fact we prove the statement for a much larger family of sets than just discs; in particular if one picks $c_n$ randomly from the main cardioid of the Mandelbrot set, then the Julia set is still almost always totally disconnected.

Motion of a Legged Bidirectional Miniature Piezoelectric Robot Based on Traveling Wave Generation

This article reports on the locomotion performance of a miniature robot that features 3D-printed rigid legs driven by linear traveling waves (TWs). The robot structure was a millimeter-sized rectangular glass plate with two piezoelectric patches attached, which allowed for traveling wave generation at a frequency between the resonant frequencies of two contiguous flexural modes. As a first goal, the location and size of the piezoelectric patches were calculated to maximize the structural displacement while preserving a standing wave ratio close to 1 (cancellation of wave reflections from the boundaries). The design guidelines were supported by an analytical 1D model of the structure and could be related to the second derivative of the modal shapes without the need to rely on more complex numerical simulations. Additionally, legs were bonded to the glass plate to facilitate the locomotion of the structure; these were fabricated using 3D stereolithography printing, with a range of lengths from 0.5 mm to 1.5 mm. The optimal location of the legs was deduced from the profile of the traveling wave envelope. As a result of integrating both the optimal patch length and the legs, the speed of the robot reached as high as 100 mm/s, equivalent to 5 body lengths per second (BL/s), at a voltage of 65 Vpp and a frequency of 168 kHz. The blocking force was also measured and results showed the expected increase with the mass loading. Furthermore, the robot could carry a load that was 40 times its weight, opening the potential for an autonomous version with power and circuits on board for communication, control, sensing, or other applications.

Lax Pairs and First Integrals for Autonomous and Non-Autonomous Differential Equations Belonging to the Painlevé – Gambier List

Recently Sinelshchikov et al. [1] formulated a Lax representation for a family of nonautonomous second-order differential equations. In this paper we extend their result and obtain the Lax pair and the associated first integral of a non-autonomous version of the Levinson – Smith equation. In addition, we have obtained Lax pairs and first integrals for several equations of the Painlevé – Gambier list, namely, the autonomous equations numbered XII, XVII, XVIII, XIX, XXI, XXII, XXIII, XXIX, XXXII, XXXVII, XLI, XLIII, as well as the non-autonomous equations Nos. XV and XVI in Ince’s book.

Deceleration Planning Algorithm Based on Classified Multi-Layer Perceptron Models for Smart Regenerative Braking of EV in Diverse Deceleration Conditions

The smart regenerative braking system (SRS) is an autonomous version of one-pedal driving in electric vehicles. To implement SRS, a deceleration planning algorithm is necessary to generate the deceleration used in automatic regenerative control. To reduce the discomfort from the automatic regeneration, the deceleration should be similar to human driving. In this paper, a deceleration planning algorithm based on multi-layer perceptron (MLP) is proposed. The MLP models can mimic the human driving behavior by learning the driving data. In addition, the proposed deceleration planning algorithm has a classified structure to improve the planning performance in each deceleration condition. Therefore, the individual MLP models were designed according to three different deceleration conditions: car-following, speed bump, and intersection. The proposed algorithm was validated through driving simulations. Then, time to collision and similarity to human driving were analyzed. The results show that the minimum time to collision was 1.443 s and the velocity root-mean-square error (RMSE) with human driving was 0.302 m/s. Through the driving simulation, it was validated that the vehicle moves safely with desirable velocity when SRS is in operation, based on the proposed algorithm. Furthermore, the classified structure has more advantages than the integrated structure in terms of planning performance.

The Chaotic Saddle in the Lozi Map, Autonomous and Nonautonomous Versions

In this paper, we prove the existence of a chaotic saddle for a piecewise-linear map of the plane, referred to as the Lozi map. We study the Lozi map in its orientation and area preserving version. First, we consider the autonomous version of the Lozi map to which we apply the Conley–Moser conditions to obtain the proof of a chaotic saddle. Then we generalize the Lozi map on a nonautonomous version and we prove that the first and the third Conley–Moser conditions are satisfied, which imply the existence of a chaotic saddle. Finally, we numerically demonstrate how the structure of this nonautonomous chaotic saddle varies as parameters are varied.

A new method to generate non-autonomous discrete integrable systems via convergence acceleration algorithms

In this paper, we propose a new algebraic method to construct non-autonomous discrete integrable systems. The method starts from constructing generalizations of convergence acceleration algorithms related to discrete integrable systems. Then the non-autonomous version of the corresponding integrable systems are derived. The molecule solutions of the systems are also obtained. As an example of the application of the method, we propose a generalization of the multistep ϵ-algorithm, and then derive a non-autonomous discrete extended Lotka–Volterra equation. Since the convergence acceleration algorithm from the lattice Boussinesq equation is just a particular case of the multistep ϵ-algorithm, we have therefore arrived at a generalization of this algorithm. Finally, numerical experiments on the new algorithm are presented.