본문

서브메뉴

Homotopy-Based Divide-and-Conquer Strategy for Optimal Trajectory Planning via Mixed-Integer Programming
Homotopy-Based Divide-and-Conquer Strategy for Optimal Trajectory Planning via Mixed-Integ...
Homotopy-Based Divide-and-Conquer Strategy for Optimal Trajectory Planning via Mixed-Integer Programming

Detailed Information

자료유형  
 기사
ISSN  
15523098
서명/저자  
Homotopy-Based Divide-and-Conquer Strategy for Optimal Trajectory Planning via Mixed-Integer Programming / J.Park ; S.Karumanchi, K. Iagnemma
형태사항  
pp. 1101
기타저자  
J.Park
기타저자  
S.Karumanchi, K. Iagnemma
기본자료저록  
IEEE Transactions on Robotics : v.31 n.5 2015, 10
모체레코드  
모체정보확인
Control Number  
gtec:294773

MARC

 008151204s2015              a    a                          eng
■022    ▼a15523098
■245    ▼aHomotopy-Based  Divide-and-Conquer  Strategy  for  Optimal  Trajectory  Planning  via  Mixed-Integer  Programming▼dJ.Park▼eS.Karumanchi,  K.  Iagnemma
■300    ▼app.  1101
■7001  ▼aJ.Park
■7001  ▼aS.Karumanchi,  K.  Iagnemma
■773    ▼tIEEE  Transactions  on  Robotics▼gv.31  n.5▼d2015,  10
■SIS    ▼aKS031505▼b63154▼h3▼sG

Preview

Export

ChatGPT Discussion

AI Recommended Related Books


    New Books MORE
    Related books MORE
    Statistics for the past 3 years. Go to brief
    Recommend

    高级搜索信息

    • 预订
    • Book Loan Request Service
    • 我的文件夹
    材料
    注册编号 呼叫号码. 收藏 状态 借信息.
    AR04451 종합자료실 대출가능 대출가능
    대출신청 My Folder

    *保留在借用的书可用。预订,请点击预订按钮

    Books borrowed together with this book

    Related books

    Related Popular Books

    도서위치