Optimal Trajectory Generation for Convergence to a Rectilinear Path

This paper presents a strategy to determine the shortest path of a fixed-wing Miniature Air Vehicle (MAV), constrained by a bounded turning rate, to eventually fly along a given straight line, starting from an arbitrary but known initial position and orientation. Unlike the work available in the literature that solves the problem using the Pontryagin's Minimum Principle (PMP) the trajectory generation algorithm presented here considers a geometrical approach which is intuitive and easy to understand. This also computes the explicit solution for the length of the optimal path as a function of the initial configuration. Further, using a 6-DOF model of a MAV the generated optimal path is tracked by an autopilot consisting of proportional-integral-derivative (PID) controllers. The simulation results show the path generation and tracking for different cases.

Single network adaptive critic aided dynamic inversion for optimal regulation and command tracking with online adaptation for enhanced robustness

To combine the advantages of both stability and optimality-based designs, a single network adaptive critic (SNAC) aided nonlinear dynamic inversion approach is presented in this paper. Here, the gains of a dynamic inversion controller are selected in such a way that the resulting controller behaves very close to a pre-synthesized SNAC controller in the output regulation sense. Because SNAC is based on optimal control theory, it makes the dynamic inversion controller operate nearly optimal. More important, it retains the two major benefits of dynamic inversion, namely (i) a closed-form expression of the controller and (ii) easy scalability to command tracking applications without knowing the reference commands a priori. An extended architecture is also presented in this paper that adapts online to system modeling and inversion errors, as well as reduced control effectiveness, thereby leading to enhanced robustness. The strengths of this hybrid method of applying SNAC to optimize an nonlinear dynamic inversion controller is demonstrated by considering a benchmark problem in robotics, that is, a two-link robotic manipulator system. Copyright (C) 2013 John Wiley & Sons, Ltd.

Experimental Characterization and Control of Miniaturized Pneumatic Artificial Muscle

Robotic surgical tools used in minimally invasive surgeries (MIS) require miniaturized and reliable actuators for precise positioning and control of the end-effector. Miniature pneumatic artificial muscles (MPAMs) are a good choice due to their inert nature, high force to weight ratio, and fast actuation. In this paper, we present the development of miniaturized braided pneumatic muscles with an outer diameter of similar to 1.2 mm, a high contraction ratio of about 18%, and capable of providing a pull force in excess of 4 N at a supply pressure of 0.8 MPa. We present the details of the developed experimental setup, experimental data on contraction and force as a function of applied pressure, and characterization of the MPAM. We also present a simple kinematics and experimental data based model of the braided pneumatic muscle and show that the model predicts contraction in length to within 20% of the measured value. Finally, a robust controller for the MPAMs is developed and validated with experiments and it is shown that the MPAMs have a time constant of similar to 10 ms thereby making them suitable for actuating endoscopic and robotic surgical tools.

Autonomous Star Camera Calibration and Spacecraft Attitude Determination

This paper presents two methods of star camera calibration to determine camera calibrating parameters (like principal point, focal length etc) along with lens distortions (radial and decentering). First method works autonomously utilizing star coordinates in three consecutive image frames thus independent of star identification or biased attitude information. The parameters obtained in autonomous self-calibration technique helps to identify the imaged stars with the cataloged stars. Least Square based second method utilizes inertial star coordinates to determine satellite attitude and star camera parameters with lens radial distortion, both independent of each other. Camera parameters determined by the second method are more accurate than the first method of camera self calibration. Moreover, unlike most of the attitude determination algorithms where attitude of the satellite depend on the camera calibrating parameters, the second method has the advantage of computing spacecraft attitude independent of camera calibrating parameters except lens distortions (radial). Finally Kalman filter based sequential estimation scheme is employed to filter out the noise of the LS based estimation.

Broadcast Control Mechanism for Positional Consensus in Multiagent Systems

In this paper, a strategy for controlling a group of agents to achieve positional consensus is presented. The problem is constrained by the requirement that every agent must be given the same control input through a broadcast communication mechanism. Although the control command is computed using state information in a global framework, the control input is implemented by the agents in a local coordinate frame. We propose a novel linear programming (LP) formulation that is computationally less intensive than earlier proposed methods. Moreover, a random perturbation input in the control command that helps the agents to come close to each other even for a large number of agents, which was not possible with an existing strategy in the literature, is introduced. The method is extended to achieve positional consensus at a prespecified location. The effectiveness of the approach is illustrated through simulation results. A comparison between the LP approach and the existing second-order cone programming-based approach is also presented. The algorithm was successfully implemented on a robotic platform with three robots.

Kinematics and dynamics of Jansen leg mechanism: A bond graph approach

The Jansen mechanism is a one degree-of-freedom, planar, 12-link, leg mechanism that can be used in mobile robotic applications and in gait analysis. This paper presents the kinematics and dynamics of the Jansen leg mechanism. The forward kinematics, accomplished using circle intersection method, determines the trajectories of various points on the mechanism in the chassis (stationary link) reference frame. From the foot point trajectory, the step length is shown to vary linearly while step height varies non-linearly with change in crank radius. A dynamic model for the Jansen leg mechanism is proposed using bond graph approach with modulated multiport transformers. For given ground reaction force pattern and crank angular speed, this model helps determine the motor torque profile as well as the link and joint stresses. The model can therefore be used to rate the actuator torque and in design of the hardware and controller for such a system. The kinematics of the mechanism can also be obtained from this dynamic model. The proposed model is thus a useful tool for analysis and design of systems based on the Jansen leg mechanism. (C) 2015 Elsevier B.V. All rights reserved.

Electrically driven intracellular and extracellular nanomanipulators evoke neurogenic/cardiomyogenic differentiation in human mesenchymal stem cells

Nanomechanical intervention through electroactuation is an effective strategy to guide stem cell differentiation for tissue engineering and regenerative medicine. In the present study, we elucidate that physical forces exerted by electroactuated gold nanoparticles (GNPs) have a strong influence in regulating the lineage commitment of human mesenchymal stem cells (hMSCs). A novel platform that combines intracellular and extracellular GNPs as nano-manipulators was designed to trigger neurogenic/cardiomyogenic differentiation in hMSCs, in electric field stimulated culture condition. In order to mimic the native microenvironment of nerve and cardiac tissues, hMSCs were treated with physiologically relevant direct current electric field (DC EF) or pulsed electric field (PEF) stimuli, respectively. When exposed to regular intermittent cycles of DC EF stimuli, majority of the GNP actuated hMSCs acquired longer filopodial extensions with multiple branch-points possessing neural-like architecture. Such morphological changes were consistent with higher mRNA expression level for neural-specific markers. On the other hand, PEF elicited cardiomyogenic differentiation, which is commensurate with the tubelike morphological alterations along with the upregulation of cardiac specific markers. The observed effect was significantly promoted even by intracellular actuation and was found to be substrate independent. Further, we have substantiated the participation of oxidative signaling, G0/G1 cell cycle arrest and intracellular calcium Ca2+] elevation as the key upstream regulators dictating GNP assisted hMSC differentiation. Thus, by adopting dual stimulation protocols, we could successfully divert the DC EF exposed cells to differentiate predominantly into neural-like cells and PEF treated cells into cardiomyogenic-like cells, via nanoactuation of GNPs. Such a novel multifaceted approach can be exploited to combat tissue loss following brain injury or heart failure. (C) 2015 Elsevier Ltd. All rights reserved.

Kernelization complexity of possible winner and coalitional manipulation problems in voting

In the POSSIBLE WINNER problem in computational social choice theory, we are given a set of partial preferences and the question is whether a distinguished candidate could be made winner by extending the partial preferences to linear preferences. Previous work has provided, for many common voting rules, fixed parameter tractable algorithms for the POSSIBLE WINNER problem, with number of candidates as the parameter. However, the corresponding kernelization question is still open and in fact, has been mentioned as a key research challenge 10]. In this paper, we settle this open question for many common voting rules. We show that the POSSIBLE WINNER problem for maximin, Copeland, Bucklin, ranked pairs, and a class of scoring rules that includes the Borda voting rule does not admit a polynomial kernel with the number of candidates as the parameter. We show however that the COALITIONAL MANIPULATION problem which is an important special case of the POSSIBLE WINNER problem does admit a polynomial kernel for maximin, Copeland, ranked pairs, and a class of scoring rules that includes the Borda voting rule, when the number of manipulators is polynomial in the number of candidates. A significant conclusion of our work is that the POSSIBLE WINNER problem is harder than the COALITIONAL MANIPULATION problem since the COALITIONAL MANIPULATION problem admits a polynomial kernel whereas the POSSIBLE WINNER problem does not admit a polynomial kernel. (C) 2015 Elsevier B.V. All rights reserved.