请问HN：系统中测试路径的代理排列
考虑一个由N个组件和M个组件之间的配对连接构成的系统，存在无限的[组件，命令，...]序列用于一系列操作。一个组件显示数据，而命令显然是执行某个指令。
这里有没有人研究过使用代理选择基于用户意图的快乐路径进行测试？对此是否有相关文献？这似乎是一个成本、计算和意图优化的问题。
假设延迟是一个限制条件。
看起来这是一些人工智能研究人员可以参与讨论的内容。我有自己的看法，但想听听社区的想法。
查看原文
Given a system with N components and M pairwise connections between said N components, there exists infinite sequences of [component, command, ...] for a series of operations. A component displays data and a command obviously executes a command.<p>Has anyone here done research on using an agant to select happy paths to test based on user intent? Is there literature on this? Seems like a cost, compute, intent optimization problem.<p>Assume latency is a restriction.<p>Seems like something some AI research folks here can chime in on. I have my own opinions but want to hear what the community thinks.