Isbn: 9781332874705 - on-line motion planning: case of a planar rod (classic reprint) (3 risultati)

Perfeziona la tua ricerca

  • Libri (3)

  • Nuovo (3)

a

Fascia di prezzo personalizzata (EUR)

a

  • Lingua: Inglese

    Editore: Forgotten Books, 2018

    1332874703 / 9781332874705

    • Brossura

    Da: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 25,37

     Spedizione gratuita 
    Spedito in U.S.A.

    Quantità: 15 disponibili

    PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

  • Lingua: Inglese

    Editore: Forgotten Books, 2018

    1332874703 / 9781332874705

    • Brossura

    Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 24,65

    EUR 3,88 spedizione 
    Spedito da Regno Unito a U.S.A.

    Quantità: 15 disponibili

    PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

  • Altre immagini

    Lingua: Inglese

    Editore: Forgotten Books, 2024

    1332874703 / 9781332874705

    • Brossura
    • Print on Demand

    Da: Forgotten Books, London, Regno UnitoForgotten Books

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 15,93

     Spedizione gratuita 
    Spedito da Regno Unito a U.S.A.

    Quantità: Più di 20 disponibili

    Paperback. Condizione: New. Print on Demand. This book develops an algorithm for planning the motion of a rod-shaped object within a two-dimensional space containing obstacles bounded by simple, closed polygons. While previous approaches to motion planning assumed the planning algorithm had an explicit description of the scene as input, the author develops an algorithm that does not require this. Instead, it only requires the algorithm to be able to obtain information about obstacles by detecting points of contact with the obstacles. The computational complexity of the algorithm is O(n^2), which is optimal for the general motion planning problem. The book thus advances the field of motion planning and will be of interest to researchers working in robotics and other areas that require autonomous motion. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.…