Search arXiv⌕ Search

arXiv · cs/0702149

Coupling Control and Human-Centered Automation in Mathematical Models of Complex Systems

Abstract

In this paper we analyze mathematically how human factors can be effectively incorporated into the analysis and control of complex systems. As an example, we focus our discussion around one of the key problems in the Intelligent Transportation Systems (ITS) theory and practice, the problem of speed control, considered here as a decision making process with limited information available. The problem is cast mathematically in the general framework of control problems and is treated in the context of dynamically changing environments where control is coupled to human-centered automation. Since in this case control might not be limited to a small number of control settings, as it is often assumed in the control literature, serious difficulties arise in the solution of this problem. We demonstrate that the problem can be reduced to a set of Hamilton-Jacobi-Bellman equations where human factors are incorporated via estimations of the system Hamiltonian. In the ITS context, these estimations can be obtained with the use of on-board equipment like sensors/receivers/actuators, in-vehicle communication devices, etc. The proposed methodology provides a way to integrate human factor into the solving process of the models for other complex dynamic systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Roderick V. N. Melnik. 2007-02-25. Coupling Control and Human-Centered Automation in Mathematical Models of Complex Systems. https://arxiv.org/abs/cs/0702149

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

BizAgentBench: Unveiling Hidden Challenges in Deploying Long-Horizon Agents for Real-World Business

Existing long-horizon agent benchmarks often emphasize final task success while providing limited assessment of intermediate execution validity. Yet real-world business operations require agents to navigate extensive, potentially outdated or conflicting policies while satisfying critical constraints throughout execution. These requirements are particularly consequential in high-stakes domains such as payments, where intermediate violations can incur financial losses or regulatory consequences regardless of the final outcome. To bridge this evaluation gap, we introduce BizAgentBench, a multi-turn benchmark grounded in real-world procedures from a leading payments company. Its executable environment integrates 789 knowledge documents and 601 discoverable business tools, with consistent policies, states, and tool behavior. The benchmark comprises 50 tasks involving resource constraints, temporal dependencies, prior commitments, and conflicting or outdated guidance. Each task is validated through reference execution, while deterministic checks assess both goal attainment and execution validity without prescribing a single solution path. Experiments reveal substantial limitations even among frontier models: Claude Opus 5 and GPT-6 Sol achieve strict success rates of only 64.0% and 61.3%, respectively. For Qwen3.8-27B, goal attainment reaches 42.0%, but strict success drops to 32.7%, demonstrating how outcome-based evaluation can mask invalid execution. Beyond success rates, DeepSeek-V4.1-Flash averages 191.3 tool calls per run, approximately 70% more than reference executions, revealing substantial execution overhead. Overall, BizAgentBench establishes a testbed for evaluating and advancing long-horizon agents beyond task completion, toward reliable and constraint-compliant execution in complex business environments.

cs.CE↗

Amortized Optimization for Calibrating Stochastic Social Simulators

Stochastic simulators need suitable parameter values to reproduce observed behaviour in complex systems. Searching for these values through repeated simulations makes frequent recalibration computationally expensive. We develop an amortized optimizer that uses simulations collected in advance to learn how to choose parameters that make simulated outcomes agree with observations. Once fitted, it maps new observations to feasible parameters without further simulator calls. The method retains alternative parameter settings that can explain similar observations and compares their responses, avoiding the conflicting labels that arise when training a single parameter regressor. Historical observations also provide supervision by showing which simulated responses agree with the data, even when the underlying parameters are unknown. Experiments across four simulators compare calibration accuracy and query time. Dedicated cost analyses quantify traffic preparation and the recorded financial reuse costs. On new traffic targets, local correction more than halves query time relative to empirical and surrogate selection; a learned inverse is faster still, with similar mean error. In a retrospective comparison on real financial data, our method returns parameters about $1.07\times10^{7}$ times faster than a 10-minute Gaussian-process Bayesian optimization search, with mean calibration error 3.06% higher. Reusing simulation work across observations supports repeated parameter updates when the available time is too short for a new search.

cs.CE↗

Physics-informed latent conditional flow matching for generative modeling of granular flows on inclined planes

The internal kinematic and mechanical states of granular flows are difficult to observe or measure, limiting the interpretation of internal particle interactions and their role in flow evolution. In this study, we propose a physics-informed latent conditional flow matching (PI-LCFM) framework for reconstructing complete multivariable flow sequences from partial boundary observations. A variational autoencoder and temporal flow-matching model learn a reusable latent prior over velocity, granular temperature, stress, and solid volume fraction. During inference, boundary-velocity or basal-stress observations and mass- and momentum-conservation constraints guide the latent trajectory through the decoded physical fields, without retraining either model. The results demonstrate that the model accurately reconstructs full spatiotemporal fields from observations containing only 0.3\% of the complete field information, extrapolates beyond the training ranges of inclination and particle number, and recovers key trends in runout scaling, energy evolution, and stress profiles. Compared with a frame-by-frame conditional flow-matching baseline, PI-LCFM reduces the mean velocity-component root-mean-square error by 45.2\%, while observation-guided reconstruction of 500-frame sequences achieves an approximately 44-fold speedup. Physics guidance further improves conservation consistency, supporting the broader potential of this framework for inferring hidden states in particulate systems, with potential applications envisioned in geophysical hazard assessment and industrial process monitoring.

cs.CE↗