How to map a guest stay journey
How to map a guest stay journey at a hotel front desk, from arrival to the room key, with an exception branch for each place the path can stop. Live check-in example with swimlanes.
A guest stay looks like one smooth path from the door to the room. Map the path first, then give every place it can stop its own branch, and the front desk process becomes something a new colleague can follow.
The short version
- Draw the arrival-to-key line first, then ask of every step what happens if it fails.
- Give each exception its own labelled branch: no booking, mismatch, room not ready, declined card.
- Decide for each branch whether it rejoins the spine, loops back or ends the process.
- Put a manager decision on any exception the desk should not settle alone.
- Add lanes last and count the handoffs the guest waits through.
The front-of-house path and where it stops
Most hotel check-in charts show the happy path and nothing else: the guest arrives, the desk finds the booking, a key is cut and the guest goes upstairs. That is the part everyone already knows. The part that fills a shift is everything that interrupts it. The booking cannot be found, the name on the card does not match the booking, the room is not ready, the card is declined. Each of those is a decision with a second exit, and a chart that omits the exits leaves new staff to learn them from the guests.
So the method is to draw the spine first and the exceptions second. Write the steps from arrival to the room key as one plain line, with no lanes and no branches. Then walk the line one step at a time and ask what happens if this step fails. Every answer becomes a decision with a labelled branch. Some of the branches rejoin the spine, such as a walk-in booking that carries on to registration. Some loop back, such as a room that is prioritised and checked again. Some end the process, such as a check-in that is declined and the guest told how to follow up.
Only after the exceptions are drawn should the steps be placed into lanes for the guest, the front desk agent, the duty manager, housekeeping and the bell desk. A lane crossing is a handoff, and in a guest journey every handoff is a moment the guest is standing at the desk waiting. Counting the crossings between arrival and key is a quick way to see where the wait comes from.
The example below is a hotel guest check-in process in QueryChart, built in five stages. House rules differ by property, brand and country, including what identification is accepted and how a card hold is taken, so treat the chart as a structure to adapt against your own procedures rather than a statement of what any hotel must do.
From arrival to the room key
A hotel check-in with a walk-in branch, an identity mismatch, a room that is not ready and a payment hold that can be declined.
Arrival and the booking lookup
The guest arrives and gives a name or booking reference, and the desk looks for the reservation. The first decision asks whether it was found. If so the path goes straight on. If not, a short side step checks availability and creates a walk-in booking, and that branch rejoins the same spine at registration.
Identity and the manager exception
The guest signs the registration card and shows photo identification, and the desk checks it against the booking. A decision asks whether the details are complete and the identification is accepted. A mismatch does not stop the process at once. It goes to the duty manager, who either accepts the guest or declines the check-in, and a declined check-in ends with the guest told how to follow up.
The room that is not ready
Next a decision asks whether the room is clean and ready for this arrival time. If not, the desk offers luggage storage and a place to wait, housekeeping prioritises the room and reports it ready, and the line returns to the same decision. That return line is the loop: the guest does not move on until the answer is yes.
Payment and the declined card
With a room assigned, the desk takes a payment pre-authorisation on the card. If it is approved the path continues. If it is declined, a decision asks whether the guest offers another card or a cash deposit, and yes returns to the payment step. If not, the check-in stops and the room is released, which is the second place the process can end early.
Keys, luggage and the lanes
The desk encodes the keys and explains breakfast, wifi and check-out, the bell desk takes the luggage to the room and the stay is open in the system. With the logic fixed, the lanes for the guest, front desk agent, duty manager, housekeeping and bell desk show every handoff, and the ones the guest waits through are the ones to shorten.
How it works
Write the happy path as one line
List the steps from arrival to the room key in order and add them in QueryChart as a single row of boxes. Leave out lanes and branches for now. The aim is a spine you can read in a few seconds.
Ask what fails at each step
Go through the line and note what can go wrong at every box: no booking, an identification mismatch, a room that is not ready, a card that is declined. Each answer becomes a decision with a yes branch and a labelled exception branch.
Decide where each exception goes
For every exception branch choose one of three outcomes. It rejoins the spine, it loops back to the decision that sent it away, or it ends the process with a reason. Draw the line accordingly.
Name who decides the exceptions
Add a decision for the duty manager where the desk should not settle a case alone, such as accepting a guest whose details do not match. Keep the manager off the spine so the normal path stays short.
Make every end say why
Give each early ending its own end box with a reason in the label, such as a declined check-in or a released room. Those records answer later questions from guests and managers.
Assign lanes and count the handoffs
Move the steps into lanes for the guest, the desk, the manager, housekeeping and the bell desk. Each lane crossing is a handoff. Mark the ones where the guest is waiting at the desk.
Mistakes to avoid
Drawing only the happy path
A chart with no exception branches describes the best day. New staff need the other days, so draw the failures as decisions.
An exception with no exit
A not ready room that never returns to the decision, or a declined card with no ending, leaves the chart unfinished. Every branch should rejoin, loop or end.
Sending every exception to the manager
If every mismatch goes up, the manager becomes the process. Keep the desk's own options visible and escalate only what needs a decision.
Starting with lanes
Lanes first gives a picture of departments. The path and its exceptions first gives a picture of the stay.
Map your own guest stay journey
Open the hotel check-in example as your own chart, change the checks and exceptions to match your property, and then assign the lanes.
Related guides
Frequently asked questions
What is the first thing to draw in a hotel check-in process?
The line from arrival to the room key with no exceptions. Once it reads clearly, add a decision wherever a step can fail, and add lanes last.
How do I show a room that is not ready on a flowchart?
As a loop. A decision asks whether the room is ready. Yes continues to room assignment. Not ready leads to a waiting step and a prioritise step, and a line returns to the same decision. For the housekeeping side read /templates/hotel-room-turnaround-housekeeping-process.
Where does this chart connect to the rest of the guest stay?
Before it sits the booking, in /templates/hotel-reservation-and-booking-process, and for arrivals that belong to a block of rooms see /templates/hotel-group-booking-and-rooming-list-process. At the other end of the day, /guides/how-to-map-a-daily-close-process covers the evening reconciliation.
Is the chart a statement of how hotels must register guests?
No. Identification rules, registration requirements and card handling differ by property, brand and country. The chart shows a structure; put your own rules in the labels and comments.