{"ID":2828057,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2512.15462","arxiv_id":"2512.15462","title":"Intent-Driven UAM Rescheduling","abstract":"Due to the restricted resources, efficient scheduling in vertiports has received much more attention in the field of Urban Air Mobility (UAM). For the scheduling problem, we utilize a Mixed Integer Linear Programming (MILP), which is often formulated in a resource-restricted project scheduling problem (RCPSP). In this paper, we show our approach to handle both dynamic operation requirements and vague rescheduling requests from humans. Particularly, we utilize a three-valued logic for interpreting ambiguous user intents and a decision tree, proposing a newly integrated system that combines Answer Set Programming (ASP) and MILP. This integrated framework optimizes schedules and supports human inputs transparently. With this system, we provide a robust structure for explainable, adaptive UAM scheduling.","short_abstract":"Due to the restricted resources, efficient scheduling in vertiports has received much more attention in the field of Urban Air Mobility (UAM). For the scheduling problem, we utilize a Mixed Integer Linear Programming (MILP), which is often formulated in a resource-restricted project scheduling problem (RCPSP). In this...","url_abs":"https://arxiv.org/abs/2512.15462","url_pdf":"https://arxiv.org/pdf/2512.15462v1","authors":"[\"Jeongseok Kim\",\"Kangjin Kim\"]","published":"2025-12-17T14:04:14Z","proceeding":"cs.AI","tasks":"[\"cs.AI\",\"cs.HC\",\"cs.SC\"]","methods":"[]","has_code":false}