Search for: All records

Creators/Authors contains: "Wang, Jiaqi"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Mechanical instabilities can convert slow actuation into rapid, amplified motion, but predicting whether a three-dimensional elastic structure buckles smoothly or snaps remains challenging. Here, we show that helix geometry and boundary loading jointly select continuous buckling or snap-through in elastic filaments. Combining nonlinear rod theory, simulations, and high-throughput robotic arm experiments, we establish a predictive pathway map and identify snap-through as a robust mechanism for repeatable motion amplification under simple boundary actuation. Guided by this map, we design a snap-actuated helical limb that converts small end rotations into rapid global reconfiguration and cyclic energy release. Integrated into an untethered robot, this limb enables sustained hopping across wood, cloth, acrylic, leather, grass, and sand, reaching 3.21 body lengths per second with an electrical cost of transport of 4.79. Controlled comparisons with a rigid-legged robot show that snap-through drives the gains in speed, efficiency, and terrain robustness. The same limb architecture also enables agile turning, repeated back-flips, and swimming. 
    more » « less
    Free, publicly-accessible full text available September 18, 2027
  2. Free, publicly-accessible full text available March 1, 2027
  3. D-optimal experimental design is a classical statistical problem in which one chooses a collection of data vectors, from some available large pool, in order to maximize a measure of predictive quality. In the classical formulation, the only constraint is on the cardinality of the collection, that is, the number of vectors chosen. We study a more general budget-constrained variant in which vectors have heterogeneous costs, and develop four new algorithms (two deterministic and two randomized) with approximation guarantees. Our methods handle heterogeneous costs using a novel exchange rule that interchanges packs of data vectors whose total costs are similar (up to some controlled amount of rounding error). The algorithms outperform the only existing method for this problem from both theoretical and empirical standpoints. Funding: The first and third authors gratefully acknowledge support from the National Science Foundation (NSF) Division of Civil, Mechanical and Manufacturing Innovation [Grant CMMI-2112828]. The second author gratefully acknowledges support from the NSF Division of Computing and Communication Foundations [Grant CCF-2246417] and Office of Naval Research [Grant N00014-24-1-2066]. 
    more » « less
  4. Routing a Vehicle to Collect Data After an Earthquake In the immediate aftermath of a major earthquake, it is crucial to quickly and accurately assess structural damage throughout the region. It is especially important to identify buildings that have become unsafe in order to prioritize evacuation efforts. Only a very small number of building inspections can be feasibly performed in a narrow time frame; however, their results can then be combined with other data sources to predict damage at other locations that were not inspected. In “D-Optimal Orienteering for Postearthquake Reconnaissance Planning,” Wang, Xie, Ryzhov, Marković, and Ou present a novel nonlinear integer program that combines vehicle routing with a statistical objective, the goal being to maximize data quality. An exact method based on row and column generation is developed to solve problems with up to 200 buildings. The approach is validated in a realistic case study using real-world building data obtained from a state-of-the-art earthquake simulator. 
    more » « less
  5. Free, publicly-accessible full text available November 13, 2026