A Heuristic Framework for Path Planning the Largest Volume Object from a Start to Goal Configuration

Evan Shellshear, Robert Bohlin

2014

Abstract

In this article we present a heuristic algorithm to compute the largest volume of an object in three dimensions that can move collision-free from a start configuration to a goal configuration through a virtual environment. The results presented here provide industrial designers with a framework to reduce the number of design iterations when designing parts to be placed in tight spaces.

Paper Citation

in Harvard Style

Shellshear E. and Bohlin R. (2014). A Heuristic Framework for Path Planning the Largest Volume Object from a Start to Goal Configuration . In Proceedings of the 11th International Conference on Informatics in Control, Automation and Robotics - Volume 2: ICINCO, ISBN 978-989-758-040-6, pages 264-271. DOI: 10.5220/0005002102640271

in Bibtex Style

@conference{icinco14,
author={Evan Shellshear and Robert Bohlin},
title={A Heuristic Framework for Path Planning the Largest Volume Object from a Start to Goal Configuration},
booktitle={Proceedings of the 11th International Conference on Informatics in Control, Automation and Robotics - Volume 2: ICINCO,},
year={2014},
pages={264-271},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005002102640271},
isbn={978-989-758-040-6},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 11th International Conference on Informatics in Control, Automation and Robotics - Volume 2: ICINCO,
TI - A Heuristic Framework for Path Planning the Largest Volume Object from a Start to Goal Configuration
SN - 978-989-758-040-6
AU - Shellshear E.
AU - Bohlin R.
PY - 2014
SP - 264
EP - 271
DO - 10.5220/0005002102640271