Ultra-light robotic prosthetic hand enables efficient and stable grasping through simple control
Case Study Evaluation of an Auditory Alert for an Autonomous Mobile Robot
Interactive robots should not just be passive companions—but active partners—like therapy horses, say researchers
Congratulations to the #AAMAS2025 best paper, best demo, and distinguished dissertation award winners

The AAMAS 2025 best paper and demo awards were presented at the 24th International Conference on Autonomous Agents and Multiagent Systems, which took place from 19-23 May 2025 in Detroit. The Distinguished Dissertation Award was also recently announced. The winners in the various categories are as follows:
Best Paper Award
Winner
- Soft Condorcet Optimization for Ranking of General Agents, Marc Lanctot, Kate Larson, Michael Kaisers, Quentin Berthet, Ian Gemp, Manfred Diaz, Roberto-Rafael Maura-Rivero, Yoram Bachrach, Anna Koop, Doina Precup
Finalists
- Azorus: Commitments over Protocols for BDI Agents, Amit K. Chopra, Matteo Baldoni, Samuel H. Christie V, Munindar P. Singh
- Curiosity-Driven Partner Selection Accelerates Convention Emergence in Language Games, Chin-Wing Leung, Paolo Turrini, Ann Nowe
- Reinforcement Learning-based Approach for Vehicle-to-Building Charging with Heterogeneous Agents and Long Term Rewards, Fangqi Liu, Rishav Sen, Jose Paolo Talusan, Ava Pettet, Aaron Kandel, Yoshinori Suzue, Ayan Mukhopadhyay, Abhishek Dubey
- Ready, Bid, Go! On-Demand Delivery Using Fleets of Drones with Unknown, Heterogeneous Energy Storage Constraints, Mohamed S. Talamali, Genki Miyauchi, Thomas Watteyne, Micael Santos Couceiro, Roderich Gross
Pragnesh Jay Modi Best Student Paper Award
Winners
- Decentralized Planning Using Probabilistic Hyperproperties, Francesco Pontiggia, Filip Macák, Roman Andriushchenko, Michele Chiari, Milan Ceska
- Large Language Models for Virtual Human Gesture Selection, Parisa Ghanad Torshizi, Laura B. Hensel, Ari Shapiro, Stacy Marsella
Runner-up
- ReSCOM: Reward-Shaped Curriculum for Efficient Multi-Agent Communication Learning, Xinghai Wei, Tingting Yuan, Jie Yuan, Dongxiao Liu, Xiaoming Fu
Finalists
- Explaining Facial Expression Recognition, Sanjeev Nahulanthran, Leimin Tian, Dana Kulic, Mor Vered
- Agent-Based Analysis of Green Disclosure Policies and Their Market-Wide Impact on Firm Behavior, Lingxiao Zhao, Maria Polukarov, Carmine Ventre
Blue Sky Ideas Track Best Paper Award
Winner
- Grounding Agent Reasoning in Image Schemas: A Neurosymbolic Approach to Embodied Cognition, François Olivier, Zied Bouraoui
Finalist
- Towards Foundation-model-based multiagent system to Accelerate AI for social impact, Yunfan Zhao, Niclas Boehmer, Aparna Taneja, Milind Tambe
Best Demo Award
Winner
- Serious Games for Ethical Preference Elicitation, Jayati Deshmukh, Zijie Liang, Vahid Yazdanpanah, Sebastian Stein, Sarvapali Ramchurn
Victor Lesser Distinguished Dissertation Award
The Victor Lesser Distinguished Dissertation Award is given for dissertations in the field of autonomous agents and multiagent systems that show originality, depth, impact, as well as quality of writing, supported by high-quality publications.
Winner
- Jannik Peters. Thesis title: Facets of Proportionality: Selecting Committees, Budgets, and Clusters
Runner-up
- Lily Xu. Thesis title: High-stakes decisions from low-quality data: AI decision-making for planetary health
Horses ‘mane’ inspiration for new generation of social robots
Robot morphs midair to switch from flying to rolling on terrain
Mid-air transformation helps flying, rolling robot to transition smoothly
VR could help train employees working with robots
Algorithm improves acoustic sensor accuracy for cheaper underwater robotics
Soft robots can walk themselves out of a 3D printer
Designing Pareto-optimal GenAI workflows with syftr
You’re not short on tools. Or models. Or frameworks.
What you’re short on is a principled way to use them — at scale.
Building effective generative AI workflows, especially agentic ones, means navigating a combinatorial explosion of choices.
Every new retriever, prompt strategy, text splitter, embedding model, or synthesizing LLM multiplies the space of possible workflows, resulting in a search space with over 10²³ possible configurations.
Trial-and-error doesn’t scale. And model-level benchmarks don’t reflect how components behave when stitched into full systems.
That’s why we built syftr — an open source framework for automatically identifying Pareto-optimal workflows across accuracy, cost, and latency constraints.
The complexity behind generative AI workflows
To illustrate how quickly complexity compounds, consider even a relatively simple RAG pipeline like the one shown in Figure 1.
Each component—retriever, prompt strategy, embedding model, text splitter, synthesizing LLM—requires careful selection and tuning. And beyond those decisions, there’s an expanding landscape of end-to-end workflow strategies, from single-agent workflows like ReAct and LATS to multi-agent workflows like CaptainAgent and Magentic-One.

What’s missing is a scalable, principled way to explore this configuration space.
That’s where syftr comes in.
Its open source framework uses multi-objective Bayesian Optimization to efficiently search for Pareto-optimal RAG workflows, balancing cost, accuracy, and latency across configurations that would be impossible to test manually.
Benchmarking Pareto-optimal workflows with syftr
Once syftr is applied to a workflow configuration space, it surfaces candidate pipelines that achieve strong tradeoffs across key performance metrics.
The example below shows syftr’s output on the CRAG (Comprehensive RAG) Sports benchmark, highlighting workflows that maintain high accuracy while significantly reducing cost.

While Figure 2 shows what syftr can deliver, it’s equally important to understand how those results are achieved.
At the core of syftr is a multi-objective search process designed to efficiently navigate vast workflow configuration spaces. The framework prioritizes both performance and computational efficiency – essential requirements for real-world experimentation at scale.

Since evaluating every workflow in this space isn’t feasible, we typically evaluate around 500 workflows per run.
To make this process even more efficient, syftr includes a novel early stopping mechanism — Pareto Pruner — which halts evaluation of workflows that are unlikely to improve the Pareto frontier. This significantly reduces computational cost and search time while preserving result quality.
Why current benchmarks aren’t enough
While model benchmarks, like MMLU, LiveBench, Chatbot Arena, and the Berkeley Function-Calling Leaderboard, have advanced our understanding of isolated model capabilities, foundation models rarely operate alone in real-world production environments.
Instead, they’re typically one component — albeit an essential one — within larger, sophisticated AI systems.
Measuring intrinsic model performance is critical, but it leaves open critical system-level questions:
- How do you construct a workflow that meets task-specific goals for accuracy, latency, and cost?
- Which models should you use—and in which parts of the pipeline?
syftr addresses this gap by enabling automated, multi-objective evaluation across entire workflows.
It captures nuanced tradeoffs that emerge only when components interact within a broader pipeline, and systematically explores configuration spaces that are otherwise impractical to evaluate manually.
Inspiration and related work
syftr is the first open-source framework specifically designed to automatically identify Pareto-optimal generative AI workflows that balance multiple competing objectives simultaneously — not just accuracy, but latency and cost as well.
It draws inspiration from existing research, including:
- AutoRAG, which focuses solely on optimizing for accuracy
- Kapoor et al. ‘s work, AI Agents That Matter, which emphasizes cost-controlled evaluation to prevent incentivizing overly costly, leaderboard-focused agents. This principle serves as one of our core research inspirations.
Importantly, syftr is also orthogonal to LLM-as-optimizer frameworks like Trace and TextGrad, and generic flow optimizers like DSPy. Such frameworks can be combined with syftr to further optimize prompts in workflows.
In early experiments, syftr first identified Pareto-optimal workflows on the CRAG Sports benchmark.
We then applied Trace to optimize prompts across all of those configurations — taking a two-stage approach: multi-objective workflow search followed by fine-grained prompt tuning.
The result: notable accuracy improvements, especially in low-cost workflows that initially exhibited lower accuracy (those clustered in the lower-left of the Pareto frontier). These gains suggest that post-hoc prompt optimization can meaningfully boost performance, even in highly cost-constrained settings.
This two-stage approach — first multi-objective configuration search, then prompt refinement — highlights the benefits of combining syftr with specialized downstream tools, enabling modular and flexible workflow optimization strategies.

Building and extending syftr’s search space
Syftr cleanly separates the workflow search space from the underlying optimization algorithm. This modular design enables users to easily extend or customize the space, adding or removing flows, models, and components by editing configuration files.
The default implementation uses Multi-Objective Tree-of-Parzen-Estimators (MOTPE), but syftr supports swapping in other optimization strategies.
Contributions of new flows, modules, or algorithms are welcomed via pull request at github.com/datarobot/syftr.

Built on the shoulders of open source
syftr builds on a number of powerful open source libraries and frameworks:
- Ray for distributing and scaling search over large clusters of CPUs and GPUs
- Ray Serve for autoscaling model hosting
- Optuna for its flexible define-by-run interface (similar to PyTorch’s eager execution) and support for state-of-the-art multi-objective optimization algorithms
- LlamaIndex for building sophisticated agentic and non-agentic RAG workflows
- HuggingFace Datasets for fast, collaborative, and uniform dataset interface
- Trace for optimizing textual components within workflows, such as prompts
syftr is framework-agnostic: workflows can be constructed using any orchestration library or modeling stack. This flexibility allows users to extend or adapt syftr to fit a wide variety of tooling preferences.
Case study: syftr on CRAG Sports
Benchmark setup
The CRAG benchmark dataset was introduced by Meta for the KDD Cup 2024 and includes three tasks:
- Task 1: Retrieval summarization
- Task 2: Knowledge graph and web retrieval
- Task 3: End-to-end RAG
syftr was evaluated on Task 3 (CRAG3), which includes 4,400 QA pairs spanning a wide range of topics. The official benchmark performs RAG over 50 webpages retrieved for each question.
To increase difficulty, we combined all webpages across all questions into a single corpus, creating a more realistic, challenging retrieval setting.

Note: Amazon Q pricing uses a per-user/month pricing model, which differs from the per-query token-based cost estimates used for syftr workflows.
Key observations and insights
Across datasets, syftr consistently surfaces meaningful optimization patterns:
- Non-agentic workflows dominate the Pareto frontier. They’re faster and cheaper, leading the optimizer to favor these configurations more frequently than agentic ones.
- GPT-4o-mini frequently appears in Pareto-optimal flows, suggesting it offers a strong balance of quality and cost as a synthesizing LLM.
- Reasoning models like o3-mini perform well on quantitative tasks (e.g., FinanceBench, InfiniteBench), likely due to their multi-hop reasoning capabilities.
- Pareto frontiers eventually flatten after an initial rise, with diminishing returns in accuracy relative to steep cost increases, underscoring the need for tools like syftr that help pinpoint efficient operating points.
We routinely find that the workflow at the knee point of the Pareto frontier loses just a few percentage points in accuracy compared to the most accurate setup — while being 10x cheaper.
syftr makes it easy to find that sweet spot.
Cost of running syftr
In our experiments, we allocated a budget of ~500 workflow evaluations per task. Although exact costs vary based on the dataset and search space complexity, we consistently identified strong Pareto frontiers with a one-time search cost of approximately $500 per use case.
We expect this cost to decrease as more efficient search algorithms and space definitions are developed.
Importantly, this initial investment is minimal relative to the long-term gains from deploying optimized workflows, whether through reduced compute usage, improved accuracy, or better user experience in high-traffic systems.
For detailed results across six benchmark tasks, including datasets beyond CRAG, refer to the full syftr paper.
Getting started and contributing
To get started with syftr, clone or fork the repository on GitHub. Benchmark datasets are available on HuggingFace, and syftr also supports user-defined datasets for custom experimentation.
The current search space includes:
- 9 proprietary LLMs
- 11 embedding models
- 4 general prompt strategies
- 3 retrievers
- 4 text splitters (with parameter configurations)
- 4 agentic RAG flows and 1 non-agentic RAG flow, each with associated hierarchical hyperparameters
New components, such as models, flows, or search modules, can be added or modified via configuration files. Detailed walkthroughs are available to support customization.
syftr is developed fully in the open. We welcome contributions via pull requests, feature proposals, and benchmark reports. We’re particularly interested in ideas that advance the research direction or improve the framework’s extensibility.
What’s ahead for syftr
syftr is still evolving, with several active areas of research designed to extend its capabilities and practical impact:
- Meta-learning
Currently, each search is performed from scratch. We’re exploring meta-learning techniques that leverage prior runs across similar tasks to accelerate and guide future searches. - Multi-agent workflow evaluation
While multi-agent systems are gaining traction, they introduce additional complexity and cost. We’re investigating how these workflows compare to single-agent and non-agentic pipelines, and when their tradeoffs are justified. - Composability with prompt optimization frameworks
syftr is complementary to tools like DSPy, Trace, and TextGrad, which optimize textual components within workflows. We’re exploring ways to more deeply integrate these systems to jointly optimize structure and language. - More agentic tasks
We started with question-answer tasks, a critical production use case for agents. Next, we plan to rapidly expand syftr’s task repertoire to code generation, data analysis, and interpretation. We also invite the community to suggest additional tasks for syftr to prioritize.
As these efforts progress, we aim to expand syftr’s value as a research tool, a benchmarking framework, and a practical assistant for system-level generative AI design.
If you’re working in this space, we welcome your feedback, ideas, and contributions.
Try the code, read the research
To explore syftr further, check out the GitHub repository or read the full paper on ArXiv for details on methodology and results.
Syftr has been accepted to appear at the International Conference on Automated Machine Learning (AutoML) in September, 2025 in New York City.
We look forward to seeing what you build and discovering what’s next, together.
The post Designing Pareto-optimal GenAI workflows with syftr appeared first on DataRobot.
How AI, Robotics, and Automation Power Next Generation Pack Assembly
Legal Considerations for Robots-as-a-Service (RaaS) in Warehousing
Congratulations to the #ICRA2025 best paper award winners

The 2025 IEEE International Conference on Robotics and Automation (ICRA) best paper winners and finalists in the various different categories have been announced. The recipients were revealed during an award ceremony at the conference, which took place from 19-23 May in Atlanta, USA.
IEEE ICRA Best Paper Award on Robot Learning
Winner
- *Robo-DM: Data Management for Large Robot Datasets, Kaiyuan Chen, Letian Fu, David Huang, Yanxiang Zhang, Yunliang Lawrence Chen, Huang Huang, Kush Hari, Ashwin Balakrishna, Ted Xiao, Pannag Sanketi, John Kubiatowicz, Ken Goldberg
Finalists
- Achieving Human Level Competitive Robot Table Tennis, David D’Ambrosio, Saminda Wishwajith Abeyruwan, Laura Graesser, Atil Iscen, Heni Ben Amor, Alex Bewley, Barney J. Reed, Krista Reymann, Leila Takayama, Yuval Tassa, Krysztof Choromanski, Erwin Coumans, Deepali Jain, Navdeep Jaitly, Natasha Jaques, Satoshi Kataoka, Yuheng Kuang, Nevena Lazic, Reza, Mahjourian, Sherry Moore, Kenneth Oslund, Anish Shankar, Vikas Sindhwani, Vincent Vanhoucke, Grace Vesom, Peng Xu, Pannag Sanketi
- *No Plan but Everything under Control: Robustly Solving Sequential Tasks with Dynamically Composed Gradient Descent, Vito Mengers, Oliver Brock
IEEE ICRA Best Paper Award in Field and Service Robotics
Winner
- *PolyTouch: A Robust Multi-Modal Tactile Sensor for Contact-Rich Manipulation Using Tactile-Diffusion Policies, Jialiang Zhao, Naveen Kuppuswamy, Siyuan Feng, Benjamin Burchfiel, Edward Adelson
Finalists
- A New Stereo Fisheye Event Camera for Fast Drone Detection and Tracking, Daniel Rodrigues Da Costa, Maxime Robic, Pascal Vasseur, Fabio Morbidi
- *Learning-Based Adaptive Navigation for Scalar Field Mapping and Feature Tracking, Jose Fuentes, Paulo Padrao, Abdullah Al Redwan Newaz, Leonardo Bobadilla
IEEE ICRA Best Paper Award on Human-Robot Interaction
Winner
- *Human-Agent Joint Learning for Efficient Robot Manipulation Skill Acquisition, Shengchent Luo, Quanuan Peng, Jun Lv, Kaiwen Hong, Katherin Driggs-Campbell, Cewu Lu, Yong-Lu Li
Finalists
- *To Ask or Not to Ask: Human-In-The-Loop Contextual Bandits with Applications in Robot-Assisted Feeding, Rohan Banerjee, Rajat Kumar Jenamani, Sidharth Vasudev, Amal Nanavati, Katherine Dimitropoulou, Sarah Dean, Tapomayukh Bhattacharjee
- *Point and Go: Intuitive Reference Frame Reallocation in Mode Switching for Assistive Robotics, Allie Wang, Chen Jiang, Michael Przystupa, Justin Valentine, Martin Jagersand
IEEE ICRA Best Paper Award on Mechanisms and Design
Winner
- Individual and Collective Behaviors in Soft Robot Worms Inspired by Living Worm Blobs, Carina Kaeser, Junghan Kwon, Elio Challita, Harry Tuazon, Robert Wood, Saad Bhamla, Justin Werfel
Finalists
- *Informed Repurposing of Quadruped Legs for New Tasks, Fuchen Chen, Daniel Aukes
- *Intelligent Self-Healing Artificial Muscle: Mechanisms for Damage Detection and Autonomous, Ethan Krings, Patrick Mcmanigal, Eric Markvicka
IEEE ICRA Best Paper Award on Planning and Control
Winner
- *No Plan but Everything under Control: Robustly Solving Sequential Tasks with Dynamically Composed Gradient Descent, Vito Mengers, Oliver Brock
Finalists
- *SELP: Generating Safe and Efficient Task Plans for Robot Agents with Large Language Models, Yi Wu, Zikang Xiong, Yiran Hu, Shreyash Sridhar Iyengar, Nan Jiang, Aniket Bera, Lin Tan, Suresh Jagannathan
- *Marginalizing and Conditioning Gaussians Onto Linear Approximations of Smooth Manifolds with Applications in Robotics, Zi Cong Guo, James Richard Forbes, Timothy Barfoot
IEEE ICRA Best Paper Award in Robot Perception
Winner
- *MAC-VO: Metrics-Aware Covariance for Learning-Based Stereo Visual Odometry, Yuheng Qju, Yutian Chen, Zihao Zhang, Wenshan Wang, Sebastian Scherer
Finalists
- *Ground-Optimized 4D Radar-Inertial Odometry Via Continuous Velocity Integration Using Gaussian Process, Wooseong Yang, Hyesu Jang, Ayoung Kim
- *UAD: Unsupervised Affordance Distillation for Generalization in Robotic Manipulation, Yihe Tang, Wenlong Huang, Yingke Wang, Chengshu Li, Roy Yuan, Ruohan Zhang, Jiajun Wu, Li Fei-Fei
IEEE ICRA Best Paper Award in Robot Manipulation and Locomotion
Winner
- *D(R, O) Grasp: A Unified Representation of Robot and Object Interaction for Cross-Embodiment Dexterous Grasping, Zhenyu Wei, Zhixuan Xu, Jingxiang Guo, Yiwen Hou, Chongkai Gao, Zhehao Cai, Jiayu Luo, Lin Shao
Finalists
- *Full-Order Sampling-Based MPC for Torque-Level Locomotion Control Via Diffusion-Style Annealing, Haoru Xue, Chaoyi Pan, Zeji Yi, Guannan Qu, Guanya Shi
- *TrofyBot: A Transformable Rolling and Flying Robot with High Energy Efficiency, Mingwei Lai, Yugian Ye, Hanyu Wu, Chice Xuan, Ruibin Zhang, Qiuyu Ren, Chao Xu, Fei Gao, Yanjun Cao
IEEE ICRA Best Paper Award in Automation
Winner
- *Physics-Aware Robotic Palletization with Online Masking Inference, Tiangi Zhang, Zheng Wu, Yuxin Chen, Yixiao Wang, Boyuan Liang, Scott Moura, Masayoshi Tomizuka, Mingyu Ding, Wei Zhan
Finalists
- *In-Plane Manipulation of Soft Micro-Fiber with Ultrasonic Transducer Array and Microscope, Jieyun Zou, Siyuan An, Mingyue Wang, Jiaqi Li, Yalin Shi, You-Fu Li, Song Liu
- *A Complete and Bounded-Suboptimal Algorithm for a Moving Target Traveling Salesman Problem with Obstacles in 3D, Anoop Bhat, Geordan Gutow, Bhaskhar Vundurthy, Zhonggiang, Sivakumar Rathinam, Howie Choset
IEEE ICRA Best Paper Award in Medical Robotics
Winner
- *In-Vivo Tendon-Driven Rodent Ankle Exoskeleton System for Sensorimotor Rehabilitation, Juwan Han, Seunghyeon Park, Keehon Kim
Finalists
- *Image-Based Compliance Control for Robotic Steering of a Ferromagnetic Guidewire, An Hu, Chen Sun, Adam Dmytriw, Nan Xiao, Yu Sun
- *AutoPeel: Adhesion-Aware Safe Peeling Trajectory Optimization for Robotic Wound Care, Xiao Liang, Youcheng Zhang, Fei Liu, Florian Richter, Michael C. Yip
IEEE ICRA Best Paper Award on Multi-Robot Systems
Winner
- *Deploying Ten Thousand Robots: Scalable Imitation Learning for Lifelong Multi-Agent Path Finding, He Jiang, Yutong Wang, Rishi Veerapaneni, Tanishq Harish Duhan, Guillaume Adrien Sartoretti, Jiaoyang Li
Finalists
- Distributed Multi-Robot Source Seeking in Unknown Environments with Unknown Number of Sources, Lingpeng Chen, Siva Kailas, Srujan Deolasee, Wenhao Luo, Katia Sycara, Woojun Kim
- *Multi-Nonholonomic Robot Object Transportation with Obstacle Crossing Using a Deformable Sheet, Weijian Zhang, Charlie Street, Masoumeh Mansouri
IEEE ICRA Best Conference Paper Award
Winners
- *Marginalizing and Conditioning Gaussians Onto Linear Approximations of Smooth Manifolds with Applications in Robotics, Zi Cong Guo, James Richard Forbes, Timothy Barfoot
- *MAC-VO: Metrics-Aware Covariance for Learning-Based Stereo Visual Odometry, Yuheng Qju, Yutian Chen, Zihao Zhang, Wenshan Wang, Sebastian Scherer
In addition to the papers listed above, these paper were also finalists for the IEEE ICRA Best Conference Paper Award.
Finalists
- *MiniVLN: Efficient Vision-And-Language Navigation by Progressive Knowledge Distillation, Junyou Zhu, Yanyuan Qiao, Siqi Zhang, Xingjian He, Qi Wu, Jing Liu
- *RoboCrowd: Scaling Robot Data Collection through Crowdsourcing, Suvir Mirchandani, David D. Yuan, Kaylee Burns, Md Sazzad Islam, Zihao Zhao, Chelsea Finn, Dorsa Sadigh
- How Sound-Based Robot Communication Impacts Perceptions of Robotic Failure, Jai’La Lee Crider, Rhian Preston, Naomi T. Fitter
- *Obstacle-Avoidant Leader Following with a Quadruped Robot, Carmen Scheidemann, Lennart Werner, Victor Reijgwart, Andrei Cramariuc, Joris Chomarat, Jia-Ruei Chiu, Roland Siegwart, Marco Hutter
- *Dynamic Tube MPC: Learning Error Dynamics with Massively Parallel Simulation for Robust Safety in Practice, William Compton, Noel Csomay-Shanklin, Cole Johnson, Aaron Ames
- *Bat-VUFN: Bat-Inspired Visual-And-Ultrasound Fusion Network for Robust Perception in Adverse Conditions, Gyeongrok Lim, Jeong-ui Hong, Min Hyeon Bae
- *TinySense: A Lighter Weight and More Power-Efficient Avionics System for Flying Insect-Scale Robots, Zhitao Yu, Josh Tran, Claire Li, Aaron Weber, Yash P. Talwekar, Sawyer Fuller
- *TSCLIP: Robust CLIP Fine-Tuning for Worldwide Cross-Regional Traffic Sign Recognition, Guoyang Zhao, Fulong Ma, Weiging Qi, Chenguang Zhang, Yuxuan Liu, Ming Liu, Jun Ma
- *Geometric Design and Gait Co-Optimization for Soft Continuum Robots Swimming at Low and High Reynolds Numbers, Yanhao Yang, Ross Hatton
- *ShadowTac: Dense Measurement of Shear and Normal Deformation of a Tactile Membrane from Colored Shadows, Giuseppe Vitrani, Basile Pasquale, Michael Wiertlewski
- *Occlusion-aware 6D Pose Estimation with Depth-guided Graph Encoding and Cross-semantic Fusion for Robotic Grasping, Jingyang Liu, Zhenyu Lu, Lu Chen, Jing Yang, Chenguang Yang
- *Stable Tracking of Eye Gaze Direction During Ophthalmic Surgery, Tinghe Hong, Shenlin Cai, Boyang Li, Kai Huang
- *Configuration-Adaptive Visual Relative Localization for Spherical Modular Self-Reconfigurable Robots, Yuming Liu, Qiu Zheng, Yuxiao Tu, Yuan Gao, Guanqi Liang, Tin Lun Lam
- *Realm: Real-Time Line-Of-Sight Maintenance in Multi-Robot Navigation with Unknown Obstacles, Ruofei Bai, Shenghai Yuan, Kun Li, Hongliang Guo, Wei-Yun Yau, Lihua Xie
IEEE ICRA Best Student Paper Award
Winners
- *Deploying Ten Thousand Robots: Scalable Imitation Learning for Lifelong Multi-Agent Path Finding, He Jiang, Yutong Wang, Rishi Veerapaneni, Tanishq Harish Duhan, Guillaume Adrien Sartoretti, Jiaoyang Li
- *ShadowTac: Dense Measurement of Shear and Normal Deformation of a Tactile Membrane from Colored Shadows, Giuseppe Vitrani, Basile Pasquale, Michael Wiertlewski
- *Point and Go: Intuitive Reference Frame Reallocation in Mode Switching for Assistive Robotics, Allie Wang, Chen Jiang, Michael Przystupa, Justin Valentine, Martin Jagersand
- *TinySense: A Lighter Weight and More Power-Efficient Avionics System for Flying Insect-Scale Robots, Zhitao Yu, Josh Tran, Claire Li, Aaron Weber, Yash P. Talwekar, Sawyer Fuller
Note: papers with an * were eligible for the IEEE ICRA Best Student Paper Award.