As autonomous systems rely increasingly on onboard sensors for localization and perception, the parallel tasks of motion planning and state estimation become increasingly coupled. This coupling is well-captured by augmenting the planning objective with a posteriorcovariance penalty -however, online optimization can be computationally intractable, particularly for observation models with latent environmental dependencies (e.g., unknown landmarks). This paper addresses a number of fundamental challenges in efficient minimization of the posterior covariance particular to landmark-and SLAM-based estimators. First, we provide a measurement bundling approximation that enables high-rate sensors to be approximated with fewer, low-rate updates. This allows for landmark marginalization (crucial in the case of unknown landmarks), for which we provide a novel recipe for computing the gradients necessary for optimization. Finally, we identify a large class of measurement models for which the contributions from each landmark can be directly combined, making evaluation of the information gained at each timestep (nearly) independent of the number of landmarks. This additionally opens the door for generalization to landmark distributions, foregoing the need for landmark linearization points to be known a priori. Taken together, these contributions allow SLAM estimators to be accurately and efficiently approximated, paving the way for online trajectory optimization.