default search action
Johan S. Carlson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Tobias Karlsson, Edvin Åblad, Tomas Hermansson, Johan S. Carlson, G. Tenfält:
Automatic Cable Harness Layout Routing in a Customizable 3D Environment. Comput. Aided Des. 169: 103671 (2024) - 2023
- [j13]Edvin Åblad, Domenico Spensieri, Robert Bohlin, Johan S. Carlson, Ann-Brith Strömberg:
Spatial-Temporal Load Balancing and Coordination of Multi-Robot Stations. IEEE Trans Autom. Sci. Eng. 20(4): 2203-2214 (2023) - [i2]Domenico Spensieri, Johan S. Carlson, Fredrik Ekstedt, Robert Bohlin:
An Iterative Approach for Collision Feee Routing and Scheduling in Multirobot Stations. CoRR abs/2309.01149 (2023) - [i1]Tobias Karlsson, Edvin Åblad, Tomas Hermansson, Johan S. Carlson, G. Tenfält:
Automatic cable harness layout routing in a customizable 3D environment. CoRR abs/2311.09061 (2023) - 2022
- [j12]Daniel Gleeson, Stefan Jakobsson, Raad Salman, Fredrik Ekstedt, Niklas Sandgren, Fredrik Edelvik, Johan S. Carlson, Bengt Lennartson:
Generating Optimized Trajectories for Robotic Spray Painting. IEEE Trans Autom. Sci. Eng. 19(3): 1380-1391 (2022) - 2021
- [j11]Domenico Spensieri, Edvin Åblad, Jonas Kressin, Johan S. Carlson, Alf Andersson:
Collision-Free Robot Coordination and Visualization Tools for Robust Cycle Time Optimization. J. Comput. Inf. Sci. Eng. 21(4) (2021) - [j10]Tomas Hermansson, Johan S. Carlson, Joachim Linn, Jonas Kressin:
Quasi-static path optimization for industrial robots with dress packs. Robotics Comput. Integr. Manuf. 68: 102055 (2021) - [j9]Domenico Spensieri, Edvin Åblad, Robert Bohlin, Johan S. Carlson, Rikard Söderberg:
Modeling and optimization of implementation aspects in industrial robot coordination. Robotics Comput. Integr. Manuf. 69: 102097 (2021) - 2020
- [c10]Daniel Gleeson, Stefan Jakobsson, Raad Salman, Niklas Sandgren, Fredrik Edelvik, Johan S. Carlson, Bengt Lennartson:
Robot spray painting trajectory optimization. CASE 2020: 1135-1140 - [c9]Evan Shellshear, Yi Li, Robert Bohlin, Johan S. Carlson:
Contact-based Bounding Volume Hierarchy for Assembly Tasks. ICRA 2020: 9185-9190 - [c8]Yi Li, Evan Shellshear, Robert Bohlin, Johan S. Carlson:
Construction of Bounding Volume Hierarchies for Triangle Meshes with Mixed Face Sizes. ICRA 2020: 9191-9195
2010 – 2019
- 2019
- [c7]Daniel Gleeson, Christian Larsen, Johan S. Carlson, Bengt Lennartson:
Implementation of a Rapidly Executing Robot Controller. CASE 2019: 1341-1346 - 2018
- [j8]Edvin Åblad, Domenico Spensieri, Robert Bohlin, Johan S. Carlson:
Intersection-Free Geometrical Partitioning of Multirobot Stations for Cycle Time Optimization. IEEE Trans Autom. Sci. Eng. 15(2): 842-851 (2018) - 2016
- [j7]Tomas Hermansson, Robert Bohlin, Johan S. Carlson, Rikard Söderberg:
Automatic routing of flexible 1D components with functional and manufacturing constraints. Comput. Aided Des. 79: 27-35 (2016) - [j6]Kristina Wärmefjord, Johan S. Carlson, Rikard Söderberg:
Controlling Geometrical Variation Caused by Assembly Fixtures. J. Comput. Inf. Sci. Eng. 16(1) (2016) - [j5]Cornelia Jareteg, Kristina Wärmefjord, Christoffer Cromvik, Rikard Söderberg, Lars Lindkvist, Johan S. Carlson, Stig Larsson, Fredrik Edelvik:
Geometry Assurance Integrating Process Variation With Simulation of Spring-In for Composite Parts and Assemblies. J. Comput. Inf. Sci. Eng. 16(3) (2016) - [j4]Domenico Spensieri, Johan S. Carlson, Fredrik Ekstedt, Robert Bohlin:
An Iterative Approach for Collision Free Routing and Scheduling in Multirobot Stations. IEEE Trans Autom. Sci. Eng. 13(2): 950-962 (2016) - 2015
- [j3]Evan Shellshear, Rolf Berlin, Johan S. Carlson:
Maximizing Smart Factory Systems by Incrementally Updating Point Clouds. IEEE Computer Graphics and Applications 35(2): 62-69 (2015) - [c6]Daniel Gleeson, Staffan Bjorkenstam, Robert Bohlin, Johan S. Carlson, Bengt Lennartson:
Optimizing robot trajectories for automatic robot code generation. CASE 2015: 495-500 - [c5]Staffan Bjorkenstam, Johan S. Carlson, Bengt Lennartson:
Exploiting sparsity in the discrete mechanics and optimal control method with application to human motion planning. CASE 2015: 769-774 - [c4]Evan Shellshear, Johan S. Carlson, Robert Bohlin, Sebastian Tafuri:
A multi-threaded memetic packing algorithm for the ISO luggage packing problem. CASE 2015: 1509-1514 - 2014
- [j2]Evan Shellshear, Sebastian Tafuri, Johan S. Carlson:
A multi-threaded algorithm for computing the largest non-colliding moving geometry. Comput. Aided Des. 49: 1-7 (2014) - [j1]Andreas Mark, Robert Bohlin, Daniel Segerdahl, Fredrik Edelvik, Johan S. Carlson:
Optimisation of robotised sealing stations in paint shops by process simulation and automatic path planning. Int. J. Manuf. Res. 9(1): 4-26 (2014) - 2013
- [c3]Staffan Bjorkenstam, Daniel Gleeson, Robert Bohlin, Johan S. Carlson, Bengt Lennartson:
Energy efficient and collision free motion of industrial robots using optimal control. CASE 2013: 510-515 - [c2]Domenico Spensieri, Robert Bohlin, Johan S. Carlson:
Coordination of robot paths for cycle time minimization. CASE 2013: 522-527 - 2012
- [c1]Sebastian Tafuri, Evan Shellshear, Robert Bohlin, Johan S. Carlson:
Automatic collision free path planning in hybrid triangle and point models: a case study. WSC 2012: 282:1-282:11
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint