Latest Research in Robotics

Top Research Topics in Robotics

• Robotics — 16 papers
• Robotic Path Planning Algorithms — 3 papers
• Artificial Intelligence — 2 papers
• Multiagent Systems — 2 papers
• Micro and Nano Robotics — 1 papers
• Computational Geometry — 1 papers
• Machine Learning — 1 papers
• Mobile Ad Hoc Networks — 1 papers
• Aerospace and Aviation Technology — 1 papers
• Distributed Control Multi-Agent Systems — 1 papers

Highest-Cited Papers

1. Online adaptive model‐based stochastic control with limited data: A case study with a colloidal self‐assembly system
2. Ultrafast Sampling-based Kinodynamic Planning via Differential Flatness
3. Resilient Motion Planning for Free-Flying Space Robots under Actuator Failures
4. Time-Efficient Iterative Learning Planning for Safety-Critical Dynamic Obstacle Avoidance
5. OmniRisk: Omnidirectional Trajectory-Risk Learning for Agile Quadrotor Dynamic Avoidance
6. DynoFluxBench: Benchmarking Kinodynamic Space-Time Planners in Dynamic Environments
7. The inherent goodness of well educated intelligence
8. Exact Fusion and Coordinated Exploration in Multi-Robot Active Inference
9. Reversible Simplex Supervision with Post-Action Debt Accounting for Goal-Reaching RL
10. Unlabeled Multi-Robot Motion Planning with Improved Separation Trade-offs
11. Neural Operator Learning for Collision-Aware Trajectory Planning of Spacecraft Swarms
12. Learning Multi-Agent Task Assignment and Navigation in the Factory: from Simulation to Real Robots
13. Distributed Optimization of Modular Production Systems using Model-based Reinforcement Learning with Inverse Models
14. Distributed multi-agent coordination for energy-constrained patrolling
15. Reachability-Certified Subteam Decomposition for Locally Interacting Multi-Agent MDPs
16. Multi-Horizon 3D Position Prediction for IoT-Enabled UAVs: A Sensor-Enriched LSTM Benchmark in AirSim
17. Distributed Dexterous Manipulation with Spatially Conditioned Multi-Agent Transformers
18. Bundle Length Tradeoffs in Decentralized Multi-Robot Task Allocation Under Degraded Communications
19. Achieving Asymptotic Near-Optimality Without $δ$-Similarity
20. Coordinated motion planning: Multi-agent path finding in a densely packed, bounded domain