arXiv subjects

Ankur Mehta

Publications and source records attributed to Ankur Mehta.

27 records · Page 2Linked to original sources

arXiv2021

A Computational Design and Evaluation Tool for 3D Structures with Planar Surfaces

Three dimensional (3D) structures composed of planar surfaces can be build out of accessible materials using easier fabrication technique with shorter fabrication time. To better design 3D structures with planar surfaces, realistic models are required to understand and evaluate mechanical behaviors. Existing design tools are either effort-consuming (e.g. finite element analysis) or bounded by assumptions (e.g. numerical solutions). In this project, We have built a computational design tool that is (1) capable of rapidly and inexpensively evaluating planar surfaces in 3D structures, with sufficient computational efficiency and accuracy; (2) applicable to complex boundary conditions and loading conditions, both isotropic materials and orthotropic materials; and (3) suitable for rapid accommodation when design parameters need to be adjusted. We demonstrate the efficiency and necessity of this design tool by evaluating a glass table as well as a wood bookcase, and iteratively designing an origami gripper to satisfy performance requirements. This design tool gives non-expert users as well as engineers a simple and effective modus operandi in structural design.

cs.GR↗

arXiv2020

Computational Design and Fabrication of Corrugated Mechanisms from Behavioral Specifications

Orthogonally assembled double-layered corrugated (OADLC) mechanisms are a class of foldable structures that harness origami-inspired methods to enhance the structural stiffness of resulting devices; these mechanisms have extensive applications due to their lightweight, compact nature as well as their high strength-to-weight ratio. However, the design of these mechanisms remains challenging. Here, we propose an efficient method to rapidly design OADLC mechanisms from desired behavioral specifications, i.e. in-plane stiffness and out-of-plane stiffness. Based on an equivalent plate model, we develop and validate analytical formulas for the behavioral specifications of OADLC mechanisms; the analytical formulas can be described as expressions of design parameters. On the basis of the analytical expressions, we formulate the design of OADLC mechanisms from behavioral specifications into an optimization problem that minimizes the weight with given design constraints. The 2D folding patterns of the optimized OADLC mechanisms can be generated automatically and directly delivered for fabrication. Our rapid design method is demonstrated by developing stiffness-enhanced mechanisms with a desired out-of-plane stiffness for a foldable gripper that enables a blimp to perch steadily under air disturbance and weight limit.

cs.RO↗

arXiv2020

Towards One-Dollar Robots: An Integrated Design and Fabrication Strategy for Electromechanical Systems

To improve the accessibility of robotics, we propose a design and fabrication strategy to build low-cost electromechanical systems for robotic devices. Our method, based on origami-inspired cut-and-fold and E-textiles techniques, aims at minimizing the resources for robot creation. Specifically, we explore techniques to create robots with the resources restricted to single-layer sheets (e.g. polyester film) and conductive sewing threads. To demonstrate our strategy's feasibility, these techniques are successfully integrated into an electromechanical oscillator (about 0.40 USD), which can generate electrical oscillation under constant-current power and potentially be used as a simple robot controller in lieu of additional external electronics.

cs.RO↗

arXiv2020

Risk-Averse MPC via Visual-Inertial Input and Recurrent Networks for Online Collision Avoidance

In this paper, we propose an online path planning architecture that extends the model predictive control (MPC) formulation to consider future location uncertainties for safer navigation through cluttered environments. Our algorithm combines an object detection pipeline with a recurrent neural network (RNN) which infers the covariance of state estimates through each step of our MPC's finite time horizon. The RNN model is trained on a dataset that comprises of robot and landmark poses generated from camera images and inertial measurement unit (IMU) readings via a state-of-the-art visual-inertial odometry framework. To detect and extract object locations for avoidance, we use a custom-trained convolutional neural network model in conjunction with a feature extractor to retrieve 3D centroid and radii boundaries of nearby obstacles. The robustness of our methods is validated on complex quadruped robot dynamics and can be generally applied to most robotic platforms, demonstrating autonomous behaviors that can plan fast and collision-free paths towards a goal point.

cs.RO↗

arXiv2020

Risk-Aware Motion Planning for a Limbed Robot with Stochastic Gripping Forces Using Nonlinear Programming

We present a motion planning algorithm with probabilistic guarantees for limbed robots with stochastic gripping forces. Planners based on deterministic models with a worst-case uncertainty can be conservative and inflexible to consider the stochastic behavior of the contact, especially when a gripper is installed. Our proposed planner enables the robot to simultaneously plan its pose and contact force trajectories while considering the risk associated with the gripping forces. Our planner is formulated as a nonlinear programming problem with chance constraints, which allows the robot to generate a variety of motions based on different risk bounds. To model the gripping forces as random variables, we employ Gaussian Process regression. We validate our proposed motion planning algorithm on an 11.5 kg six-limbed robot for two-wall climbing. Our results show that our proposed planner generates various trajectories (e.g., avoiding low friction terrain under the low risk bound, choosing an unstable but faster gait under the high risk bound) by changing the probability of risk based on various specifications.

cs.RO↗

arXiv2020

Event-Triggered Diffusion Kalman Filters

Distributed state estimation strongly depends on collaborative signal processing, which often requires excessive communication and computation to be executed on resource-constrained sensor nodes. To address this problem, we propose an event-triggered diffusion Kalman filter, which collects measurements and exchanges messages between nodes based on a local signal indicating the estimation error. On this basis, we develop an energy-aware state estimation algorithm that regulates the resource consumption in wireless networks and ensures the effectiveness of every consumed resource. The proposed algorithm does not require the nodes to share its local covariance matrices, and thereby allows considerably reducing the number of transmission messages. To confirm its efficiency, we apply the proposed algorithm to the distributed simultaneous localization and time synchronization problem and evaluate it on a physical testbed of a mobile quadrotor node and stationary custom ultra-wideband wireless devices. The obtained experimental results indicate that the proposed algorithm allows saving 86% of the communication overhead associated with the original diffusion Kalman filter while causing deterioration of performance by 16% only. We make the Matlab code and the real testing data available online.

eess.SY↗

arXiv2019

Toward Synergic Learning for Autonomous Manipulation of Deformable Tissues via Surgical Robots: An Approximate Q-Learning Approach

In this paper, we present a synergic learning algorithm to address the task of indirect manipulation of an unknown deformable tissue. Tissue manipulation is a common yet challenging task in various surgical interventions, which makes it a good candidate for robotic automation. We propose using a linear approximate Q-learning method in which human knowledge contributes to selecting useful yet simple features of tissue manipulation while the algorithm learns to take optimal actions and accomplish the task. The algorithm is implemented and evaluated on a simulation using the OpenCV and CHAI3D libraries. Successful simulation results for four different configurations which are based on realistic tissue manipulation scenarios are presented. Results indicate that with a careful selection of relatively simple and intuitive features, the developed Q-learning algorithm can successfully learn an optimal policy without any prior knowledge of tissue dynamics or camera intrinsic/extrinsic calibration parameters.

cs.RO↗

arXiv2019

Analytical Modeling for Rapid Design of Bistable Buckled Beams

Double-clamped bistable buckled beams, as the most elegant bistable mechanisms, demonstrate great versatility in various fields, such as robotics, energy harvesting, and MEMS. However, their design is always hindered by time-consuming and expensive computations. In this work, we present a method to easily and rapidly design bistable buckled beams subjected to a transverse point force. Based on the Euler-Bernoulli beam theory, we establish a theoretical model of bistable buckled beams to characterize their snap-through properties. This model is verified against the results from an FEA model, with discrepancy less than 7 %. By analyzing and simplifying our theoretical model, we derive explicit analytical expressions for critical behavioral values on the force-displacement curve of the beam. These behavioral values include critical force, critical displacement, and travel, which are generally sufficient for characterizing the snap-through properties of a bistable buckled beam. Based on these analytical formulas, we investigate the influence of a bistable buckled beam's key design parameters, including its actuation position and precompression, on its critical behavioral values, with our results validated by FEA simulations. This way, our method enables fast and computationally inexpensive design of bistable buckled beams and can guide the design of complex systems that incorporate bistable mechanisms.

physics.app-ph↗

arXiv2019

Localization Algorithm with Circular Representation in 2D and its Similarity to Mammalian Brains

Extended Kalman filter (EKF) does not guarantee consistent mean and covariance under linearization, even though it is the main framework for robotic localization. While Lie group improves the modeling of the state space in localization, the EKF on Lie group still relies on the arbitrary Gaussian assumption in face of nonlinear models. We instead use von Mises filter for orientation estimation together with the conventional Kalman filter for position estimation, and thus we are able to characterize the first two moments of the state estimates. Since the proposed algorithm holds a solid probabilistic basis, it is fundamentally relieved from the inconsistency problem. Furthermore, we extend the localization algorithm to fully circular representation even for position, which is similar to grid patterns found in mammalian brains and in recurrent neural networks. The applicability of the proposed algorithms is substantiated not only by strong mathematical foundation but also by the comparison against other common localization methods.

cs.RO↗