Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tobias Karlsson

dblp:50/10259 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
1since 2021 · last 2024
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 100%
Computer graphics and multimedia
1 paper
Computational fabrication · 77% Geometric modeling and processing · 23%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization
combinatorial optimization
0.812024
Automatic Cable Harness Layout Routing in a Customizable 3D Environment · Comput. Aided Des. 2024
Mathematical optimization › combinatorial optimization › routing problems
routing optimization
0.812024
Automatic Cable Harness Layout Routing in a Customizable 3D Environment · Comput. Aided Des. 2024
Geometric modeling and processing › 3d scene modeling
3d room modeling
0.212024
Automatic Cable Harness Layout Routing in a Customizable 3D Environment · Comput. Aided Des. 2024

Methods — techniques the papers use, named apart from their topics

pareto front approximation · 1.5deterministic routing algorithm · 1.5
YearPublicationVenuePosition
2024 Automatic Cable Harness Layout Routing in a Customizable 3D Environment
abstract
Designing cable harnesses can be time-consuming and complex due to many design and manufacturing aspects and rules. Automating the design process can help to fulfil these rules, speed up the process, and optimize the design. To accommodate this, we formulate a harness routing optimization problem to minimize cable lengths, maximize bundling by rewarding shared paths, and optimize the cables’ spatial location with respect to case-specific information of the routing environment, e.g., zones to avoid. A deterministic and computationally effective cable harness routing algorithm has been developed to solve the routing problem and is used to generate a set of cable harness topology candidates and approximate the Pareto front. Our approach was tested against a stochastic and an exact solver and our routing algorithm generated objective function values better than the stochastic approach and close to the exact solver. Our algorithm was able to find solutions, some of them being proven to be near-optimal, for three industrial-sized 3D cases within reasonable time (in magnitude of seconds to minutes) and the computation times were comparable to those of the stochastic approach.
Tobias Karlsson, Edvin Åblad, Tomas Hermansson, Johan S. Carlson, G. Tenfält
Comput. Aided Des.1
2020 Investigating the Elusive Role of Level Design
abstract
While level design is a concept commonly used in western game companies, it is veiled in a lack of clear conceptualization. Many research papers on the subject describe the role of level designer as elusive, and there is a great variation in the descriptions used in job listings for the role. This paper aims to identify a set of characteristics for the field of level design, by reviewing literature and analyzing responsibilities and requirements in job listings. To obtain more inclusive and cross-cultural results, interviews were also conducted with Japanese game developers to explain the concept of level design in their industry. By combining the qualitative data from interviews and literature analysis, with the quantitative data from job listings (n=33), the research highlights common denominators for the role of level design, but also demonstrate cultural differences and discrepancies between academia and industry. Thus suggesting gaps in current research as well as culturally. The findings aim to elucidate directions for future research, and promote focus towards the needs of the industry.
Tobias Karlsson, Yukiko Sato, Shuichi Kurabayashi
CoG1
2003 Particle filtering and Cramer-Rao lower bound for underwater navigation
abstract
We have studied a sea navigation method relying on a digital underwater terrain map and sonar measurements. The method is applicable for both ships and underwater vessels. We have used experimental data to build an underwater map and to investigate the estimation performance. Since the problem is non-linear, due to the measurement relation, we apply a sequential Monte Carlo method, or particle filter, for the state estimation. The fundamental limitations in navigation uncertainty can be described in terms of the Cramer-Rao lower bound, which is interpreted in terms of the inertial navigation system (INS) error, the sensor accuracy and the terrain map excitation. Hence, the Cramer-Rao lower bound can be interpreted and used in the design for INS systems, sensor performance or, if these are given, how much terrain or depth excitation that is needed for use in positioning and navigation.
Rickard Karlsson, Fredrik Gustafsson, Tobias Karlsson
ICASSP (6)3