7 accepted papers
Driving World Models (DWMs) have been developing rapidly with the advances of generative models. However, existing DWMs lack 3D scene understanding capabilities and can only generate content conditioned on input data, without the ability to interpret or reason about the driving environment. Moreover
This letter presents a novel wall-climbing robot design that combines kirigami-inspired adhesive tracks with negative pressure absorption, enabling reliable wall-to-wall transitions in complex environments. The kirigami-inspired tracks demonstrate a significant enhancement in adhesion performance, a
Microrobots climbing on fabrics are well-suited for reconnaissance and rescue tasks in indoor environments. However, achieving stable adhesion while maintaining a simplified locomotion mechanism remains a formidable challenge. This study presents a 4cm, 18.2g climbing robot designed with a single-ac
Constructing a unified canonical pose representation for 3D object categories is crucial for pose estimation and robotic scene understanding. Previous unified pose representations often relied on manual alignment, such as in ShapeNet and ModelNet. Recently, self-supervised canonicalization methods h
In the realm of robotics, suction-based adhesion plays a pivotal role in applications ranging from object transfer to wall-climbing robots. To improve the sealing and attachment stability of suction cups, researchers have employed state-of-the-art techniques, including the use of soft materials with
The problem of selecting a sequence of items that maximizes a given submodular function appears in many real-world applications. Existing study on the problem only considers uniform costs over items, but non-uniform costs on items are more general. Taking this cue, we study the problem of budgeted s…
Region search is an important problem in location-based services due to its wide applications. In this paper, we study the problem of optimal region search with submodular maximization (ORS-SM). This problem considers a region as a connected subgraph. We compute an objective value over the locations…