Unverified50% confidenceFactExact time
This study redesigns the solver architecture by exploiting the temporal structure of NMPC problems, so that the network size no longer depends on the length of the prediction horizon.
1
Sources
50%
Confidence
Long-term
Relevance
10/12/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe self-attention mechanism resolves the vanishing gradient problem that RNN architectures face when processing long sequences and inherently supports large-scale parallel computation69% similarUnverifiedMPC在每个时间步求解有限时域优化问题并显式处理硬约束，这是端到端神经网络难以可靠保证的特性67% similarUnverifiedIn execution partitioning, NPUs typically only accelerate a limited set of standard operators; when an unsupported operator is encountered, the framework automatically falls back to CPU execution, introducing data transfer latency.67% similarUnverifiedNNUE利用棋盘变化的稀疏性只更新受影响的网络激活值，推理速度比传统深度神经网络快两个数量级，可在CPU上实时运行65% similarUnverifiedThe new solver can handle problems of larger scale than monolithic LISCO, demonstrating that temporal decomposition removes the horizon bottleneck.65% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1001335API
curl https://kongchang.com/api/v1/knowledge/claims/1001335MCP
get_claim(id=1001335)