Dynamic icsp graph optimization approach for

HIGHLIGHTS

• who: Zhan, Wang and Alain, Lambert from the Institut Supérieur D'électronique de Paris, Paris, France have published the research: Dynamic ICSP Graph Optimization Approach for, in the Journal: (JOURNAL)
• what: To maintain the real time adaptability, the authors propose to solve the ICSP graph in a sliding window Ξ: at each timestep k; only the sub-graph Gk-Ξ→k (V, E) is taken into computation.
• how: This paper presents an Interval Constraint Satisfaction Problem (ICSP) graph based methodology for consistent car-like robot localization in outdoor environments. By dynamically solving the ICSP . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or E-mail:

  If you don't have an account, you can create one here.