Structured planning and debugging | Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
We introduce a new approach to planning in STRIPS-like domains based on constructing and analyzing a compact structure we call a Planning Graph. We describe a new planner, Graphplan, that uses this paradigm. Graphplan always returns a shortest-possible ...
Room-based maps
There are a couple of different ways to go about creating room-based maps. We'll look at doing this by generating random rectangles, by using random BSP trees and Waveform Function Collapse (WFC).
Timothy Gowers @wtgowers on Twitter / X
AI has now solved a major open problem -- one of the best known Erdos problems called the unit distance problem, one of Erdos's favourite questions and one that many mathematicians had tried.https://t.co/SD1vVPkrHR— Timothy Gowers @wtgowers (@wtgowers) May 20, 2026
Nebius.Build | OpenClaw + Robotics Hackathon
OpenClaw + Robotics hackathon powered by Nebius. Build, demo, and win awards. March 15, San Francisco, CA.
Nicole Feng
We describe a method for computing signed distance to point clouds that allows fast pointwise evaluation at arbitrary spatial resolution. As input, our method takes a point cloud with normals; as output, it provides an analytical parameterization that allows queries of signed distance to the approximate underlying surface at arbitrary points — simultaneously providing reconstruction and distance. Our key idea is to reconstruct shapes by locally fitting point clouds with tori, which have closed-form signed distance functions. Tori are fitted in a feed-forward manner, using a pre-trained network to output per-point curvature and shift parameters. Importantly, our method does not require costly global optimization or spatial discretization, and is easily parallelizable. Underlying our method is a new theory that unifies signed distance with the classic reconstruction methods of winding numbers and Poisson surface reconstruction. We use our method to compute signed distance to point clouds arising from photogrammetry, meshes, 3D Gaussians, and neural implicits. Our method allows point clouds to be used directly in applications, without explicit surface reconstruction: as examples, we take offsets of point clouds, apply morphological and Boolean operations, and directly visualize offset surfaces using sphere tracing.
Introducing Index: Building The World’s Largest and Most Diverse Physical Dataset
Today we're coming out of stealth with the largest robot training dataset ever built. The data needed to scale general robotics doesn't exist on the internet - it has to come from the real world: a global sampling of physics captured across every environment on earth.
zeroclaw-labs/zeroclaw
Fast, small, and fully autonomous AI assistant infrastructure — deploy anywhere, swap anything 🦀
A dive into spatial search algorithms
Searching through millions of points in an instant
MolmoAct 2: An open foundation for robots that work in the real world | Ai2
MolmoAct 2 is a fully open robotics foundation model that brings faster, stronger 3D action reasoning to real-world robot tasks, alongside a major new bimanual manipulation dataset for researchers to study, reproduce, and build on.
A red pixel in the snow: How AI solved the mystery of a missing mountaineer
Scouring remote areas for missing walkers and climbers can take rescuers weeks and sometimes months. AI can do the job in a matter of hours in some cases – and potentially save lives.
autonomous-ai/autonomous-grid
Your AI intranet: network the computers you already own for inference and training.
Getting Bots to Respect Boundaries
Getting Bots to Respect Boundaries How AI Crawlers Are Straining Web Infrastructure Audrey Hingle January 2026 Image by Janet Turra & Cambridge Diversity Fund betterimagesofai.org creativecommons.org/licenses/by/4.0 Contents Introduction: Setting up the Problem 3 Understandin...
The goal of coverage path planning is to determine a path that passes a detector over all points in an environment. This work prescribes a provably complete cov...
