Skip to main content Accessibility help
×
  1. Home
  2. Browse subjects
  3. Computer Science
  4. Content listing

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

48202 results in Computer Science

Page 708 of 2411

  • RimJump: Edge-based Shortest Path Planning for a 2D Map

  • Zhuo Yao, Weimin Zhang, Yongliang Shi, Mingzhu Li, Zhenshuo Liang, Fangxing Li, Qiang Huang
  • Journal:
    Robotica / Volume 37 / Issue 4 / April 2019
    Published online by Cambridge University Press:
    29 November 2018, pp. 641-655
    • Article
      • You have access
      • Open access
    • PDF
    • Export citation

  • Path planning under 2D map is a key issue in robot applications. However, most related algorithms rely on point-by-point traversal. This causes them usually cannot find the strict shortest path, and their time cost increases dramatically as the map scale increases. So we proposed RimJump to solve the above problem, and it is a new path planning method that generates the strict shortest path for a 2D map. RimJump selects points on the edge of barriers to form the strict shortest path. Simulation and experimentation prove that RimJump meets the expected requirements.

  • ROB volume 37 issue 1 Cover and Front matter

  • Journal:
    Robotica / Volume 37 / Issue 1 / January 2019
    Published online by Cambridge University Press:
    29 November 2018, pp. f1-f2
    • Article
      • You have access
    • PDF
    • Export citation

  • ROB volume 37 issue 1 Cover and Back matter

  • Journal:
    Robotica / Volume 37 / Issue 1 / January 2019
    Published online by Cambridge University Press:
    29 November 2018, pp. b1-b2
    • Article
      • You have access
    • PDF
    • Export citation

  • A Systematic Design Selection Methodology for System-Optimal Compliant Actuation

  • Abdullah Kamadan, Gullu Kiziltas, Volkan Patoglu
  • Journal:
    Robotica / Volume 37 / Issue 4 / April 2019
    Published online by Cambridge University Press:
    29 November 2018, pp. 656-674

  • This work presents a systematic design selection methodology that utilizes a co-design strategy for system-level optimization of compliantly actuated robots that are known for their advantages over robotic systems driven by rigid actuators. The introduced methodology facilitates a decision-making strategy that is instrumental in making selections among system-optimal robot designs actuated by various degrees of variable or fixed compliance. While the simultaneous co-design method that is utilized throughout guarantees systems performing at their full potential, a homotopy technique is used to maintain integrity via generation of a continuum of robot designs actuated with varying degrees of variable and fixed compliance. Fairness of the selection methodology is ensured via utilization of common underlying (variable) compliant actuation principle and dynamical task requirements throughout the generated system designs. The direct consequence of the developed methodology is that it allows robot designers make informed selections among a variety of systems which are guaranteed to perform at their best. Applicability of the introduced methodology has been validated using a case study for system-optimal design of an active knee prosthesis that is driven by a mechanically adjustable compliance and controllable equilibrium position actuator (MACCEPA) under a periodic/real-life dynamical task.

Artificial Intelligence and Social Work
  • Edited by Milind Tambe, Eric Rice
  • Published online:
    24 November 2018
    Print publication:
    29 November 2018
  • This book marries social work and artificial intelligence to provide an introductory guide for using AI for social good. Following an introductory chapter laying out approaches and ethical principles of using AI for social work interventions, the book describes in detail an intervention to increase the spread of HIV information by using algorithms to determine the key individuals in a social network of homeless youth. Other chapters present interdisciplinary collaborations between AI and social work students, including a chatbot for sexual health information and algorithms to determine who is at higher stress among persons with Type 2 Diabetes. For students, academic researchers, industry leaders, and practitioners, these real-life examples from the USC Center for Artificial Intelligence in Society demonstrate how social work and artificial intelligence can be used in tandem for the greater good.

Abstract Recursion and Intrinsic Complexity
  • Yiannis N. Moschovakis
  • Published online:
    23 November 2018
    Print publication:
    06 December 2018
  • This book presents and applies a framework for studying the complexity of algorithms. It is aimed at logicians, computer scientists, mathematicians and philosophers interested in the theory of computation and its foundations, and it is written at a level suitable for non-specialists. Part I provides an accessible introduction to abstract recursion theory and its connection with computability and complexity. This part is suitable for use as a textbook for an advanced undergraduate or graduate course: all the necessary elementary facts from logic, recursion theory, arithmetic and algebra are included. Part II develops and applies an extension of the homomorphism method due jointly to the author and Lou van den Dries for deriving lower complexity bounds for problems in number theory and algebra which (provably or plausibly) restrict all elementary algorithms from specified primitives. The book includes over 250 problems, from simple checks of the reader's understanding, to current open problems.

Page 708 of 2411