惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

A
About on SuperTechFans
博客园 - 聂微东
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
博客园 - 司徒正美
宝玉的分享
宝玉的分享
美团技术团队
量子位
The Cloudflare Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
IT之家
IT之家
爱范儿
爱范儿
J
Java Code Geeks
博客园 - Franky
Last Week in AI
Last Week in AI
B
Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
I
InfoQ
GbyAI
GbyAI
Recent Announcements
Recent Announcements
小众软件
小众软件
H
Help Net Security
Microsoft Azure Blog
Microsoft Azure Blog
MyScale Blog
MyScale Blog

cs updates on arXiv.org

Beyond Binary Edits Robust Multimodal Knowledge Editing with Adversarial Subspace Alignment Agentic Proving for Program Verification MemAudit: Post-hoc Auditing of Poisoned Agent Memory via Causal Attribution and Structural Anomaly Detection OpenSkillEval: Automatically Auditing the Open Skill Ecosystem for LLM Agents One Policy, Infinite NPCs: Persona-Traceable Shared RL Policies for Scalable Game Agents How Human-Like Are Large Language Models? A Register-Aware Linguistic Evaluation Framework Benchmarking Google Embeddings 2 against Open-Source Models for Multilingual Dense Retrieval and RAG Systems Structure-Guided Entity Resolution: Fine-Tuning LLMs for Robust Name Matching in Complex Linguistic Contexts Solving the Aircraft Disassembly Scheduling Problem Co-ReAct: Rubrics as Step-Level Collaborators for ReAct Agents CP or DP? Why Not Both: A Case Study in the Partial Shop Scheduling Problem Asking For An Old Friend: Diagnosing and Mitigating Temporal Failure Modes in LLM-based Statutory Question Answering EDGE-OPD: Internalizing Privileged Context with Evidence Guided On-Policy Distillation ARES: Automated Rubric Synthesis for Scalable LLM Reinforcement Learning SSDAU: Structured Semantic Data Augmentation for Joint Entity and Relation Extraction Naturalistic measure of social norms alignment Articulatory strategy as a source of variation in acoustic vowel dynamics When Planning Fails Despite Correct Execution: On Epistemic Calibration for LLM-Based Multi-Agent Systems EquiSumm : A Gender Bias-Aware Framework for Inclusive Tweet Summarization Metacognition as Reward: Reinforcing LLM Reasoning via Knowledge and Regulation Signals From Correctness to Preference: A Framework for Personalized Agentic Reinforcement Learning Cultural Adaptation in Large Language Models for Political Discourse Emotion Recognition in Sign Language Conversation ClimateChat-300K: A Multi-Modal Facebook Dataset for Understanding Diverse Perspectives in Climate Communication AraHopeCorpus: Annotation Guidelines and Dataset for Hope Speech in Arabic Social Media Crisis Discourse Human-in-the-Loop Multi-Agent Ventilator Decision Support with Contextual Bandit Preference Learning Convergence Without Understanding: When Language Models Agree on Representations but Disagree on Reasoning DART: Semantic Recoverability for Structured Tool Agents Ontological Knowledge Blocks: Executable Compliance and Profile-Based Validation for Trustworthy AI Systems Parallel Context Compaction for Long-Horizon LLM Agent Serving
Monotonic, Minimum-Settling-Time PI Tuning for First-Orde...
[Submitted on 20 Jun 2026] · 2026-06-23 · via cs updates on arXiv.org

View PDF HTML (experimental)

Abstract:This paper studies PI tuning of a first-order-plus-dead-time (FOTD) plant for the fastest strictly monotone (zero-overshoot) setpoint step response, with monotonicity imposed on the plant output only. The minimizer is shown to be neither the pole-zero cancellation design nor the multiple real dominant pole (MRDP) design. It is a non-cancellation point at which the closed loop carries a slow real mode of small residue together with a faster underdamped complex pair, with the controller zero placed near the dominant real pole. The analytical centerpiece is a single tangency identity, tan(omega tau_star + alpha) = (a - b)/omega, which states that the monotonicity boundary is the locus where the secondary complex mode just fails to drive the output slope below zero. From this identity the design reduces to nested scalar conditions, realized at three levels of fidelity: an explicit closed-form rule, an exact response-based reduction, and a simulation-free transcendental system whose only non-elementary step is a fourth-order polynomial root. Relative to the critically damped Lambert-W cancellation rule the design reduces the 2% settling time by 14 to 52 percent and lowers the load integrated absolute error by 5 to 38 percent. We report the full cost: for delay-dominated plants (T/L <= 0.55) the control stays one-pulse, so the design is itself admissible in Huba's sense and merely faster, but for larger lag ratios the control becomes two-pulse, and across the range the maximum sensitivity rises from 1.39 to between 1.44 and 1.62. The contribution is positioned not as a uniformly better tuning but as the exact characterization of a specific, well-defined operating point, with an honest multi-metric comparison against established rules.

Submission history

From: Senol Gulgonul [view email]
[v1] Sat, 20 Jun 2026 20:34:54 UTC (446 KB)