Human-AI Complex Task Planning

Sepideh Nikookar
{"title":"Human-AI Complex Task Planning","authors":"Sepideh Nikookar","doi":"10.1109/ICDE55515.2023.00382","DOIUrl":null,"url":null,"abstract":"The process of complex task planning is ubiquitous and arises in a variety of compelling applications. A few leading examples include designing a personalized course plan or trip plan, designing music playlists/work sessions in web applications, or even planning routes of naval assets to collaboratively discover an unknown destination. For all of these aforementioned applications, creating a plan requires satisfying a basic construct, i.e., composing a sequence of sub-tasks (or items) that optimizes several criteria and satisfies constraints. For instance, in course planning, sub-tasks or items are core and elective courses, and degree requirements capture their complex dependencies as constraints. In trip planning, sub-tasks are points of interests (POIs) and constraints represent time and monetary budget, or user-specified requirements. Needless to say, task plans are to be individualized and designed considering uncertainty. When done manually, the process is human-intensive and tedious, and unlikely to scale. The goal of my research is to present computational frameworks that synthesize the capabilities of human and AI algorithms to enable task planning at scale while satisfying multiple objectives and complex constraints.I present a set of computational frameworks for automated task planning as a sequence generation problem that requires minimal inputs from the end users and produces personalized task plans in an uncertain environment while satisfying multiple objectives and complex constraints. At the core, I propose a set of multi-objective optimization problems with constraints, solving which will generate task plans as a sequence of sub-tasks that are highly dependent and optimize the underlying problems. From the algorithmic standpoint, I design novel algorithms by adapting Reinforcement Learning (RL) and discrete optimization-based techniques with theoretical guarantees. I also study data engineering and data management opportunities to design scalable algorithms. Finally, I provide large-scale synthetic and real-world experiments, as well as deployment challenges in the real-world environment.","PeriodicalId":434744,"journal":{"name":"2023 IEEE 39th International Conference on Data Engineering (ICDE)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE 39th International Conference on Data Engineering (ICDE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDE55515.2023.00382","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The process of complex task planning is ubiquitous and arises in a variety of compelling applications. A few leading examples include designing a personalized course plan or trip plan, designing music playlists/work sessions in web applications, or even planning routes of naval assets to collaboratively discover an unknown destination. For all of these aforementioned applications, creating a plan requires satisfying a basic construct, i.e., composing a sequence of sub-tasks (or items) that optimizes several criteria and satisfies constraints. For instance, in course planning, sub-tasks or items are core and elective courses, and degree requirements capture their complex dependencies as constraints. In trip planning, sub-tasks are points of interests (POIs) and constraints represent time and monetary budget, or user-specified requirements. Needless to say, task plans are to be individualized and designed considering uncertainty. When done manually, the process is human-intensive and tedious, and unlikely to scale. The goal of my research is to present computational frameworks that synthesize the capabilities of human and AI algorithms to enable task planning at scale while satisfying multiple objectives and complex constraints.I present a set of computational frameworks for automated task planning as a sequence generation problem that requires minimal inputs from the end users and produces personalized task plans in an uncertain environment while satisfying multiple objectives and complex constraints. At the core, I propose a set of multi-objective optimization problems with constraints, solving which will generate task plans as a sequence of sub-tasks that are highly dependent and optimize the underlying problems. From the algorithmic standpoint, I design novel algorithms by adapting Reinforcement Learning (RL) and discrete optimization-based techniques with theoretical guarantees. I also study data engineering and data management opportunities to design scalable algorithms. Finally, I provide large-scale synthetic and real-world experiments, as well as deployment challenges in the real-world environment.
人机复杂任务规划
复杂的任务规划过程无处不在,并出现在各种引人注目的应用程序中。一些主要的例子包括设计个性化的课程计划或旅行计划,在web应用程序中设计音乐播放列表/工作会话,甚至规划海军资产的路线以协同发现未知目的地。对于前面提到的所有应用程序,创建一个计划需要满足一个基本的构造,也就是说,组合子任务(或项)的序列,以优化几个标准并满足约束。例如,在课程规划中,子任务或项是核心和选修课程,学位要求将它们的复杂依赖关系捕获为约束。在旅行计划中,子任务是兴趣点(poi),约束是时间和金钱预算,或者用户指定的需求。不用说,任务计划是个性化的,在设计时要考虑到不确定性。当手工完成时,这个过程是人力密集且乏味的,并且不太可能扩展。我的研究目标是提出计算框架,综合人类和人工智能算法的能力,在满足多个目标和复杂约束的同时,实现大规模的任务规划。我提出了一组用于自动任务规划的计算框架,作为一个序列生成问题,它需要最终用户的最小输入,并在不确定的环境中生成个性化的任务计划,同时满足多个目标和复杂的约束。在核心,我提出了一组具有约束的多目标优化问题,解决这些问题将生成任务计划,作为一系列高度依赖并优化底层问题的子任务。从算法的角度来看,我通过采用强化学习(RL)和具有理论保证的离散优化技术来设计新颖的算法。我也学习数据工程和数据管理的机会来设计可扩展的算法。最后,我提供了大规模的合成和真实世界的实验,以及真实世界环境中的部署挑战。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信