原书出处
Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)
Note that there are some significant computational speed-ups associated with the matrix inversions and multiplications in the preceding update equations because of their sparsity, which we do not cover explicitly here. In total, the total complexity for the updates is 𝒪(kn2), where k is the number of landmarks and n is the number of states. There are ways to in fact make this algorithm constant-time
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)/_epub-src/OEBPS/xhtml/chapter_17.xhtml
EPUB SHA-256:e922df804e4bed095a1b85e46ce7c83343b1af42a95fdc39ac9ab4a47b42acb1