[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-new-benchmark-shows-learning-beats-planning-under-uncertainty":10,"sections":35},{"siteName":4,"siteTagline":5,"publisherName":4,"contactEmail":6},"The Revision","Tech news, decoded.","editor@therevision.news",{"gaMeasurementId":8,"adsenseClientId":9},"G-ZW2MV82GYR","ca-pub-8533917693782264",{"article":11},{"id":12,"slug":13,"title":14,"dek":15,"body_md":16,"tags_json":17,"published_at":18,"created_at":19,"updated_at":20,"status":21,"review_note":22,"review_notes":23,"image_url":22,"persona_id":22,"persona_name":22,"section":24,"tags":25,"sources":30,"feedback":34,"feedback_at":22,"cost_usd":34,"total_tokens":34},11055,"new-benchmark-shows-learning-beats-planning-under-uncertainty","New Benchmark Shows Learning Beats Planning Under Uncertainty","A new benchmark pits classical motion planners against a PPO policy in simulated hazard fields, and the robot software only wins when the world is predictable.","A head-to-head test of robot path-planning software finds that old-school planners only win when the danger holds still.\n\nResearchers built a shared benchmark that pits classical motion planners against a reinforcement-learning policy in the same simulated arenas: flat domains dotted with rotating, sprinkler-like hazards that sweep forbidden zones across the map. When those hazards moved on a fixed, predictable schedule, the classical planners nailed it, producing near-perfect, high-quality paths. But under unpredictable, randomly-evolving hazards, classical online search turns into a time-budget gamble - too little thinking time and the planner fails outright, too much and it succeeds but drags its feet with slower, longer routes. A PPO-trained policy, trained on the same mix of scenarios, beat the classical planners on speed, success rate, and path quality whenever the hazards got unpredictable.\n\nThe real finding isn't \"AI beats math\" - it's about where the pain actually comes from. The researchers show that uncertainty in how obstacles evolve, not limited sensing or partial information, is what breaks classical planning, which matters for anything navigating a messy, dynamic space like warehouse robots, delivery drones, or cars near unpredictable pedestrians.\n\nWorth noting: this is a simulated, planar sprinkler-hazard world, not a warehouse floor or a highway, and no one shipped a new planner here - just a cleaner scoreboard for an old argument between search and learning.","[\"motion-planning\",\"reinforcement-learning\",\"robotics\",\"classical-planning\"]","2026-10-09T04:00:00.000Z","2026-10-10T04:01:13.229Z","2026-10-10T04:01:19.810Z","published",null,[],"ai",[26,27,28,29],"motion-planning","reinforcement-learning","robotics","classical-planning",[31],{"name":32,"url":33},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2610.12249",0,{"sections":36},[37,40,44,49,54,58,62,67,72,77,81,86,91,96],{"name":38,"slug":24,"count":39,"latest_published_at":18},"AI",6783,{"name":41,"slug":42,"count":43,"latest_published_at":18},"Security","security",932,{"name":45,"slug":46,"count":47,"latest_published_at":48},"Policy","policy",486,"2026-10-08T22:40:11.000Z",{"name":50,"slug":51,"count":52,"latest_published_at":53},"Deals","deals",474,"2026-10-08T22:00:00.000Z",{"name":55,"slug":56,"count":57,"latest_published_at":18},"Hardware","hardware",232,{"name":59,"slug":60,"count":61,"latest_published_at":18},"Science","science",193,{"name":63,"slug":64,"count":65,"latest_published_at":66},"Consumer Tech","consumer-tech",181,"2026-10-08T23:26:35.000Z",{"name":68,"slug":69,"count":70,"latest_published_at":71},"Startups","startups",117,"2026-10-08T16:45:00.000Z",{"name":73,"slug":74,"count":75,"latest_published_at":76},"Software","software",114,"2026-10-08T17:57:01.000Z",{"name":78,"slug":79,"count":80,"latest_published_at":18},"Dev Tools","dev-tools",106,{"name":82,"slug":83,"count":84,"latest_published_at":85},"General","general",66,"2026-10-09T04:46:11.000Z",{"name":87,"slug":88,"count":89,"latest_published_at":90},"Gaming","gaming",58,"2026-10-08T20:08:45.000Z",{"name":92,"slug":93,"count":94,"latest_published_at":95},"Reviews","reviews",34,"2026-10-08T14:00:22.000Z",{"name":97,"slug":98,"count":99,"latest_published_at":100},"How-To","how-to",8,"2026-10-05T09:00:00.000Z"]