[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-ai-framework-speeds-connected-vehicle-network-decisions-100x":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},6809,"ai-framework-speeds-connected-vehicle-network-decisions-100x","AI Framework Speeds Connected Vehicle Network Decisions 100x","Researchers trained a graph neural network to pick vehicle network relays almost as well as an optimal solver, but up to 100 times faster.","A new AI model routes data between self-driving cars and roadside sensors almost as well as the best possible answer, but does it up to 100 times faster.\n\nResearchers modeled a city's connected-vehicle network as a graph: cars and roadside units are nodes, and the radio links between them are edges. They first used mixed-integer linear programming (MILP), a precise but slow optimization method, to calculate the theoretically best way to relay data hop by hop across that graph. Then they used those optimal answers to train a graph neural network, a model built to reason over networks rather than images or text, so it could learn to approximate the same routing decisions instantly. Tested on realistic urban traffic data, the trained model recovered up to 11.3% more connectivity than simpler baseline methods, while cutting decision time by orders of magnitude compared to the MILP solver it learned from.\n\nConnected and automated vehicles need steady, low-latency links to work safely in dense cities, but cities rarely install enough roadside units to guarantee coverage, so cars often have to relay data through each other. Running a full optimization solver for every one of those routing calls is too slow for live traffic, which is exactly the gap this method is built to close.\n\nThe paper's results come from realistic urban simulations, not an actual metro area, so the real test is whether these connectivity gains hold up against real GPS drift, weather, and the hardware quirks of an actual city.","[\"v2x\",\"connected-vehicles\",\"graph-neural-networks\",\"smart-cities\"]","2026-09-18T04:00:00.000Z","2026-09-18T17:41:04.564Z","2026-09-18T17:41:16.499Z","published",null,[],"ai",[26,27,28,29],"v2x","connected-vehicles","graph-neural-networks","smart-cities",[31],{"name":32,"url":33},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2609.20271",0,{"sections":36},[37,40,44,49,54,58,62,67,71,76,81,86,91,96],{"name":38,"slug":24,"count":39,"latest_published_at":18},"AI",4017,{"name":41,"slug":42,"count":43,"latest_published_at":18},"Security","security",653,{"name":45,"slug":46,"count":47,"latest_published_at":48},"Policy","policy",338,"2026-09-11T04:00:00.000Z",{"name":50,"slug":51,"count":52,"latest_published_at":53},"Deals","deals",179,"2026-06-29T20:02:07.000Z",{"name":55,"slug":56,"count":57,"latest_published_at":18},"Hardware","hardware",155,{"name":59,"slug":60,"count":61,"latest_published_at":18},"Science","science",121,{"name":63,"slug":64,"count":65,"latest_published_at":66},"Consumer Tech","consumer-tech",99,"2026-09-09T17:27:33.000Z",{"name":68,"slug":69,"count":70,"latest_published_at":18},"Dev Tools","dev-tools",77,{"name":72,"slug":73,"count":74,"latest_published_at":75},"Software","software",75,"2026-09-10T20:41:21.000Z",{"name":77,"slug":78,"count":79,"latest_published_at":80},"Startups","startups",55,"2026-09-09T23:14:29.000Z",{"name":82,"slug":83,"count":84,"latest_published_at":85},"Gaming","gaming",43,"2026-09-10T12:18:06.000Z",{"name":87,"slug":88,"count":89,"latest_published_at":90},"General","general",41,"2026-09-08T01:57:23.000Z",{"name":92,"slug":93,"count":94,"latest_published_at":95},"Reviews","reviews",20,"2026-06-24T12:00:01.000Z",{"name":97,"slug":98,"count":99,"latest_published_at":100},"How-To","how-to",6,"2026-06-16T09:00:00.000Z"]