Jul 2026· 2026 6th International Conference on Electrical, Computer and Energy Technologies (ICECET)· pp. 1-6· 0 citations· 40 references
Abstract
Large Language Models (LLMs) offer a natural interface for smart-IoT control, yet reliable deployment requires more than producing valid API calls. Multi-device commands often contain preconditions, ordering constraints, and conflicts that must be satisfied before actions are safely executed. This paper presents DARIO, a dependency-aware orchestration framework for translating natural-language commands into verified IoT action plans. DARIO combines supervised instruction tuning, KL-regularized PPO, an explicit dependency graph $\mathcal{G}=(V, E)$, and a lightweight verifier that checks schema, execution, dependency, and safety constraints before commit. Verifier outcomes are folded into a decomposed reward, enabling the policy to learn from dependency violations rather than treating plans as flat token sequences. On a 2k-prompt held-out HA-Instruct split across five seeds, DARIO achieves $0.85 \pm 0.01$ JSON exact match, perfect schema validity, $0.91 \pm 0.01$ overall task success, and $0.81 \pm 0.02$ success on the dependency-heavy L3 split, outperforming SIT and SIT+PPO baselines by large margins. It also raises dependency satisfaction to 0.94, reduces unsafe execution to 0.02, and runs as a 4-bit 8B LoRA deployment at about 609 ms including verification.
CrisBench, a 1,200-question benchmark of lifecycle reasoning that combines a controlled formal setting with programs executed against Cordis, a runtime that manages component dependencies and cleanup, and asks models to identify affected components, predict state after a specified teardown order, and determine which co...
It is shown that LLM-driven agents can violate this condition and introduced a canonical deployment wrapper that guarantees it for arbitrary base agents while preserving already-equivariant behaviour, and it is proved that computing canonical representations required by this construction is graph-isomorphism-hard.
This paper provides a mathematical formalization of the orchestration state, detailed algorithmic analysis of the execution loop, and controlled benchmarks comparing flat and hierarchical routing under increasing tool catalogs, multi-step workflow pressure, and visible schema-token exposure per LLM call.
Prashant Devadiga, Abhishek, Adithya Mishra et al.· arXiv.org· 0 citations
This research paper proposes LLM-RAG Automation: Intelligent Function Execution and Secure System Orchestration, an intelligent automation solution that bridges the gap between natural language processing and autonomous executable workflows.
Avanish Cowkur, Rohan Nambiar, Rishi Nambiar et al.· International Journal of Inn...· 0 citations
This work presents FAVA (Formal Authorization for Verified Agents), a permission-carrying authorization framework for agent execution that utilizes an LLM-guided Permission Intermediate Representation to translate ambiguous natural-language tasks into structured constraints.
Yifan Zhang, Xin-Kui Zhao, Sai-Da Liu et al.· arXiv.org· 3 citations
Results show that MAGen translates generic LLM competence into reproducible, automation-ready contract-and-test artifacts under a fixed validation protocol.
Lixue Liu, Wei Ke, Haiyang Chi et al.· Empirical Software Engineeri...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.